scientific article; zbMATH DE number 4049676
From MaRDI portal
Publication:3786498
Recommendations
- The independence number of graphs with large odd girth
- Locally dense independent sets in regular graphs of~large~girth -- an example of a new approach
- Large independent sets in regular graphs of large girth
- On the independence number of sparse graphs
- 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
Cited in
(30)- Large independent sets in random regular graphs
- Computing independent sets in graphs with large girth
- The independence number of graphs with large odd girth
- 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
- Regular independent sets
- Improved replica bounds for the independence ratio of random regular graphs
- A tale of two balloons
- Percolation with small clusters on random graphs
- 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
- Randomly colouring graphs (a combinatorial view)
- The cook-book approach to the differential equation method
- On the independence number of sparse graphs
- Dirac's theorem for random regular graphs
- Cycles in graphs with large independence ratio
- Asymptotic optimality of degree-greedy discovering of independent sets in configuration model graphs
- Independent sets in quasi-regular graphs
- Independence ratio and random eigenvectors in transitive graphs
- Constructing the vertex-transitive graphs of order 24
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786498)
