scientific article

zbMath0644.05028MaRDI QIDQ3786498

Brendan D. McKay

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

regular graphsindependent setFibonacci numbersindependence ratio

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (23)

Percolation with small clusters on random graphs ⋮ Large independent sets in regular graphs of large girth ⋮ Invariant Gaussian processes and independent sets on regular graphs of large girth ⋮ Maximum independent sets on random regular graphs ⋮ Independence ratio and random eigenvectors in transitive graphs ⋮ Packing chromatic number of cubic graphs ⋮ Small maximal matchings in random graphs. ⋮ Improved replica bounds for the independence ratio of random regular graphs ⋮ A tale of two balloons ⋮ Constructing the vertex-transitive graphs of order 24 ⋮ Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach ⋮ Randomly colouring graphs (a combinatorial view) ⋮ The cook-book approach to the differential equation method ⋮ Subgroup growth of right‐angled Artin and Coxeter groups ⋮ Cubic graphs with small independence ratio ⋮ Replica bounds by combinatorial interpolation for diluted spin systems ⋮ Random cubic graphs are not homomorphic to the cycle of size 7 ⋮ Entropy and expansion ⋮ Asymptotic enumeration by degree sequence of graphs of high degree ⋮ Large independent sets in random regular graphs ⋮ Dirac’s theorem for random regular graphs ⋮ Regular graphs with no homomorphisms onto cycles ⋮ The matching process and independent process in random regular graphs and hypergraphs

This page was built for publication: