Publication:3786498
From MaRDI portal
zbMath0644.05028MaRDI QIDQ3786498
Publication date: 1987
05C35: Extremal problems in graph theory
Related Items
Dirac’s theorem for random regular graphs, Percolation with small clusters on random graphs, Randomly colouring graphs (a combinatorial view), The cook-book approach to the differential equation method, Independence ratio and random eigenvectors in transitive graphs, Constructing the vertex-transitive graphs of order 24, Large independent sets in random regular graphs, Small maximal matchings in random graphs., Packing chromatic number of cubic graphs, 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, Asymptotic enumeration by degree sequence of graphs of high degree, Regular graphs with no homomorphisms onto cycles, Entropy and expansion, The matching process and independent process in random regular graphs and hypergraphs, Large independent sets in regular graphs of large girth, Maximum independent sets on random regular graphs, Improved replica bounds for the independence ratio of random regular graphs, A tale of two balloons, 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, Subgroup growth of right‐angled Artin and Coxeter groups
