The Independence Ratio of Regular Graphs
From MaRDI portal
Publication:3929774
DOI10.2307/2043545zbMath0474.05057MaRDI QIDQ3929774
Publication date: 1981
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2043545
Related Items
Factor of IID Percolation on Trees, Percolation with small clusters on random graphs, Independent sets in graphs, Induced forests in cubic graphs, Independence ratio and random eigenvectors in transitive graphs, Deterministic local algorithms, unique identifiers, and fractional graph colouring, A note on the independence number of triangle-free graphs. II, Asymptotic enumeration by degree sequence of graphs of high degree, Graph imperfection. II, Large independent sets in regular graphs of large girth, Maximum independent sets on random regular graphs, Matchings in Benjamini–Schramm convergent graph sequences, Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach, Invariant Gaussian processes and independent sets on regular graphs of large girth