Invariant Gaussian processes and independent sets on regular graphs of large girth

Endre Csóka, Balázs Gerencsér, Viktor Harangi +1

We prove that every 3-regular, n-vertex simple graph with sufficiently large girth contains an independent set of size at least 0.4361n. (The best known bound is 0.4352n.) In fact,…