New bounds on even cycle creating Hamiltonian paths using expander graphs

DOI10.1007/s00493-020-4204-zzbMath1474.05232arXiv1904.04601OpenAlexW3009383418MaRDI QIDQ2220967

Gergely Harcods, Daniel Soltész

Publication date: 25 January 2021

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.04601

zbMATH Keywords

Hamiltonian pathsexpander graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Extremal combinatorics (05D99) Expander graphs (05C48)

Cites Work

• Unnamed Item
• On the number of Hamilton cycles in pseudo-random graphs
• Triangle-different Hamiltonian paths
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• On types of growth for graph-different permutations
• Ramanujan graphs
• On the maximum number of permutations with given maximal or minimal distance
• The Difference Between Consecutive Primes, II
• Degree-Doubling Graph Families
• Families of Graph-different Hamilton Paths
• On Reverse-Free Codes and Permutations
• Matrices
• Incidences and the spectra of graphs
• Graph-Different Permutations
• A new series of dense graphs of high girth
• Families of locally separated Hamilton paths
• A mean value estimate for real character sums
• An Upper Bound on Zarankiewicz' Problem
• Even cycle creating paths
• Intersecting families of sets and permutations: a survey
• On Additive Combinatorics of Permutations of \mathbb{Z}_n
• On $k$-Neighbor Separated Permutations
• Path Separation by Short Cycles
• Maximum Size of Reverse-Free Sets of Permutations
• On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
• Pairwise colliding permutations and the capacity of infinite graphs
• On Graphs that do not Contain a Thomsen Graph
• ON THE DIFFERENCE BETWEEN CONSECUTIVE PRIMES
• Intersecting families of permutations

This page was built for publication: New bounds on even cycle creating Hamiltonian paths using expander graphs