The Hamilton space of pseudorandom graphs

DOI10.1016/J.JCTB.2025.09.002MaRDI QIDQ6862417zbMATH OpenFDO

Authors Micha Christoph, Rajko Nenadov, Kalina Petrova

Publication date 9 February 2026

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2025.09.002

zbMATH Keywords

Dirac graphsexpandersextremal combinatoricsHamilton cyclespseudorandom graphsrandom graphsspanning structuresswitchers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Combinatorial probability (60C05)

Cites work

• A basis for the cycle space of a 2-connected graph
• Cycles through specified vertices of a graph
• scientific article; zbMATH DE number 3937201 (Why is no real title available?)
• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• Long cycles generate the cycle space of a graph
• On prisms, Möbius ladders and the cycle space of dense graphs
• On the cycle space of a random graph
• On the triangle space of a random graph
• Pseudo-random graphs
• Robust Hamiltonicity of Dirac graphs
• Rolling backwards can move you forward: on embedding problems in sparse expanders
• Some Theorems on Abstract Graphs
• The Hamilton spaces of Cayley graphs on abelian groups

This page was built for publication: The Hamilton space of pseudorandom graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862417)