Improved upper bounds on even-cycle creating Hamilton paths
From MaRDI portal
Publication:6570037
DOI10.1016/j.disc.2024.114107zbMATH Open1547.0516MaRDI QIDQ6570037
Publication date: 10 July 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the number of Hamilton cycles in pseudo-random graphs
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- Triangle-different Hamiltonian paths
- Ramanujan graphs
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Polarities and \(2k\)-cycle-free graphs
- New asymptotics for bipartite Turán numbers
- Large incidence-free sets in geometries
- New bounds on even cycle creating Hamiltonian paths using expander graphs
- The eigenvalues of the graphs \(D(4,q)\)
- A course in combinatorics.
- Degree-Doubling Graph Families
- Families of Graph-different Hamilton Paths
- Explicit Concentrators from Generalized N-Gons
- Matrix Analysis
- A new series of dense graphs of high girth
- Families of locally separated Hamilton paths
- Sparse pseudo‐random graphs are Hamiltonian
- Even cycle creating paths
- Intersecting families of sets and permutations: a survey
- On $k$-Neighbor Separated Permutations
- Path Separation by Short Cycles
- Recent Developments in Low-Density Parity-Check Codes
- Combinatorial theorems and integral matrices
- Intersecting families of permutations
- On the eigenvalues of the graphs \(D(5,q)\)
Related Items (1)
This page was built for publication: Improved upper bounds on even-cycle creating Hamilton paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570037)
