Random regular graphs of high degree
From MaRDI portal
Publication:2746213
DOI10.1002/rsa.1013zbMath0996.05106OpenAlexW2003791246MaRDI QIDQ2746213
Michael Krivelevich, Van H. Vu, Benjamin Sudakov, Nicholas C. Wormald
Publication date: 6 November 2002
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.1013
Related Items
Sandwiching biregular random graphs, Motif estimation via subgraph sampling: the fourth-moment phenomenon, Sandwiching random graphs: universality between random graph models, Concentration of non‐Lipschitz functions and applications, Adjacency matrices of random digraphs: singularity and anti-concentration, Random Latin square graphs, Complete Minors in Graphs Without Sparse Cuts, Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity, Small subgraphs of random regular graphs, Discrepancy properties for random regular digraphs, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Lower bounds on the chromatic number of random graphs, Hamiltonicity of graphs perturbed by a random regular graph, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, On the chromatic number of random regular graphs, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, On the second eigenvalue of random bipartite biregular graphs, Counting sets with small sumset and applications, Loose Hamilton Cycles in Regular Hypergraphs, Edge rigidity and universality of random regular graphs of intermediate degree, Hamilton decompositions of regular expanders: applications, Almost all Steiner triple systems are almost resolvable, Lower bounds for sense of direction in regular graphs, Perfect matchings and Hamiltonian cycles in the preferential attachment model, Regular induced subgraphs of a random Graph, Sparse random graphs: Eigenvalues and eigenvectors, Size biased couplings and the spectral gap for random regular graphs, Anti-concentration property for random digraphs and invertibility of their adjacency matrices, Expanders Are Universal for the Class of All Spanning Trees, Exchangeable pairs, switchings, and random regular graphs, Hamilton cycles in 3-out, Large sets in finite fields are sumsets, Voting rules that are unbiased but not transitive-symmetric, Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs, Dirac’s theorem for random regular graphs, Subgraph counts for dense random graphs with specified degrees, On the chromatic number of random \(d\)-regular graphs, Random regular graphs of non-constant degree: concentration of the chromatic number, Sandwiching dense random regular graphs between binomial random graphs, Reputation preferences resolve social dilemmas in spatial multigames, Unnamed Item, Critical percolation on random regular graphs
Cites Work
- Unnamed Item
- Automorphisms of random graphs with specified vertices
- On the independence number of random graphs
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- The asymptotic connectivity of labelled regular graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The eigenvalues of random symmetric matrices
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- On the independence and chromatic numbers of random regular graphs
- Coloring graphs with sparse neighborhoods
- Asymptotic enumeration by degree sequence of graphs of high degree
- Choosability in random hypergraphs
- List coloring of random and pseudo-random graphs
- A note on Hamiltonian circuits
- Uniform generation of random regular graphs of moderate degree
- Almost all cubic graphs are Hamiltonian
- Cliques in random graphs
- On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
- Almost all regular graphs are hamiltonian
- The Choice Number of Dense Random Graphs
- The chromatic number of random graphs
- The chromatic number of random graphs
