Powers of Hamilton cycles in pseudorandom graphs

DOI10.1007/s00493-015-3228-2zbMath1399.05118WikidataQ101496264 ScholiaQ101496264MaRDI QIDQ681592

Juan-Miguel Gracia

Publication date: 12 February 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: http://eprints.lse.ac.uk/61605/7/Powers%20of%20Hamilton%20cycles%20in%20pseudorandom%20graphs1.pdf

zbMATH Keywords

Hamiltonian cycles; asymptotic enumeration; extremal problems; pseudorandom graphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C80: Random graphs (graph-theoretic aspects)

05C38: Paths and cycles

05A16: Asymptotic enumeration

05C45: Eulerian and Hamiltonian graphs

Related Items

Triangle‐factors in pseudorandom graphs, Near-perfect clique-factors in sparse pseudorandom graphs, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Short k‐radius sequences, k‐difference sequences and universal cycles, On a degree sequence analogue of Pósa's conjecture, Near-perfect clique-factors in sparse pseudorandom graphs, Spectral radius and the 2-power of Hamilton cycle, Clique-factors in sparse pseudorandom graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• Unnamed Item
• On the number of Hamilton cycles in pseudo-random graphs
• Triangle factors in sparse pseudo-random graphs
• Limit distribution for the existence of Hamiltonian cycles in a random graph
• Hamiltonian circuits in random graphs
• Blow-up lemma
• Sparse quasi-random graphs
• Extremal results in sparse pseudorandom graphs
• Additive patterns in multiplicative subgroups
• An Improved Upper Bound on the Density of Universal Random Graphs
• On the number of hamilton cycles in a random graph
• Factors in random graphs
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
• Spanning Subgraphs of Random Graphs
• Sparse pseudo‐random graphs are Hamiltonian
• On Pósa's Conjecture for Random Graphs
• On the Number of Hamilton Cycles in Sparse Random Graphs
• Sparse universal graphs for bounded‐degree graphs
• Quasi-random graphs