33 citations · 49 across the 9 of their papers we have counts for
1 paper · 1 filter
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,…