Many Hamiltonian subsets in large graphs with given density
From MaRDI portal
Publication:6632796
DOI10.1017/S0963548323000317MaRDI QIDQ6632796
Stijn Cambie, Hong Liu, Jun Gao
Publication date: 5 November 2024
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Could not fetch data.
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Expander graphs (05C48)
Cites Work
- Explicit construction of linear sized tolerant networks
- Proof of Komlós's conjecture on Hamiltonian subsets
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Cycle lengths in expanding graphs
- Clique immersion in graphs without a fixed bipartite graph
- Long cycles in locally expanding graphs, with applications
- Hamilton decompositions of regular expanders: applications
- Large planar subgraphs in dense graphs
- Topological Cliques in Graphs
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- Topological cliques in graphs II
- Reducibility among Combinatorial Problems
- Nested cycles with no geometric crossings
- Extremal density for sparse minors and subdivisions
- Crux and Long Cycles in Graphs
- Edge-disjoint Hamilton cycles in random graphs
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
- Some Theorems on Abstract Graphs
- Ramsey numbers of cycles versus general graphs
- Disjoint isomorphic balanced clique subdivisions
- A solution to Erdős and Hajnal’s odd cycle problem
- How to build a pillar: a proof of Thomassen's conjecture
This page was built for publication: Many Hamiltonian subsets in large graphs with given density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632796)
