Cover Image

Dirac's theorem for graphs of bounded bandwidth

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Díaz, Alberto Espuny, Gupta, Pranshu, Cecchelli, Domenico Mergoni, Parczyk, Olaf, Sgueglia, Amedeo
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On product Schur triples in the integers
by: Mattos, Letícia, et al.
Published: (2023)

The square of a Hamilton cycle in randomly perturbed graphs
by: Böttcher, Julia, et al.
Published: (2022)

Spanning spheres in Dirac hypergraphs
by: Illingworth, Freddie, et al.
Published: (2024)

On Kotzig's conjecture in random graphs
by: Glock, Stefan, et al.
Published: (2025)

The Ramsey numbers of squares of paths and cycles
by: Allen, Peter, et al.
Published: (2022)

How many random edges make an almost-Dirac graph Hamiltonian?
by: Díaz, Alberto Espuny, et al.
Published: (2024)

Rainbow subgraphs of uniformly coloured randomly perturbed graphs
by: Katsamaktsis, Kyriakos, et al.
Published: (2023)

On a problem of Brown, Erdős and Sós
by: Letzter, Shoham, et al.
Published: (2023)

The square of a Hamilton cycle in randomly perturbed graphs
by: Julia Böttcher, et al.
Published: (2024)

Defect and transference versions of the Alon-Frankl-Lovasz theorem
by: Gishboliner, Lior, et al.
Published: (2025)

Steiner triple systems with high discrepancy
by: Gishboliner, Lior, et al.
Published: (2025)

Tight Hamilton cycles with high discrepancy
by: Gishboliner, Lior, et al.
Published: (2023)

Rainbow Hamiltonicity in uniformly coloured perturbed digraphs
by: Katsamaktsis, Kyriakos, et al.
Published: (2023)

On the local resilience of random geometric graphs with respect to connectivity and long cycles
by: Díaz, Alberto Espuny, et al.
Published: (2024)

On $2$-factors of Hamiltonian graphs
by: Díaz, Alberto Espuny, et al.
Published: (2026)

Seymour's second neighbourhood conjecture: random graphs and reductions
by: Díaz, Alberto Espuny, et al.
Published: (2024)

On constructing small subgraphs in the budget-constrained random graph process
by: Antoniuk, Sylwia, et al.
Published: (2026)

The maximum diameter of 2-dimensional simplicial complexes
by: Parczyk, Olaf, et al.
Published: (2025)

Graph factors and powers of Hamilton cycles in the budget-constrained random graph process
by: Díaz, Alberto Espuny, et al.
Published: (2025)

A hypergraph bandwidth theorem
by: Lang, Richard, et al.
Published: (2024)

The maximum diameter of $d$-dimensional simplicial complexes
by: Glock, Stefan, et al.
Published: (2026)

Ordered Ramsey and Turán numbers of alternating paths and their variants
by: Kucheriya, Gaurav, et al.
Published: (2026)

Simultaneous Best-Response Dynamics in Random Potential Games
by: Ashkenazi-Golan, Galit, et al.
Published: (2025)

An Unsure Note on an Un-Schur Problem
by: Parczyk, Olaf, et al.
Published: (2024)

Ramsey simplicity of random graphs
by: Boyadzhiyska, Simona, et al.
Published: (2021)

New Ramsey Multiplicity Bounds and Search Heuristics
by: Parczyk, Olaf, et al.
Published: (2022)

Forcing Graphs to be Forcing
by: Kiem, Aldo, et al.
Published: (2024)

Speeding up random walk mixing by starting from a uniform vertex
by: Díaz, Alberto Espuny, et al.
Published: (2022)

A framework for the generalised Erdős-Rothschild problem and a resolution of the dichromatic triangle case
by: Gupta, Pranshu, et al.
Published: (2025)

The Bounds of Algorithmic Collusion; $Q$-learning, Gradient Learning, and the Folk Theorem
by: Askenazi-Golan, Galit, et al.
Published: (2024)

Dirac's theorem for linear hypergraphs
by: Im, Seonghyuk, et al.
Published: (2024)

Blowing up Dirac's theorem
by: Lang, Richard, et al.
Published: (2024)

Towards a high-dimensional Dirac's theorem
by: Lee, Hyunwoo
Published: (2023)

Exponential odd-distance sets under the Manhattan metric
by: Díaz, Alberto Espuny, et al.
Published: (2024)

Robust Hamiltonicity in families of Dirac graphs
by: Anastos, Michael, et al.
Published: (2023)

Ramsey--Dirac theory for bounded degree hypertrees
by: Han, Jie, et al.
Published: (2024)

Dirac-type condition for Hamilton-generated graphs
by: Hou, Xinmin, et al.
Published: (2025)

A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs
by: Kathapurkar, Amarja, et al.
Published: (2025)

An improved quasi-isometry between graphs of bounded cliquewidth and graphs of bounded treewidth
by: Distel, Marc
Published: (2025)

Optimal bounds on the polynomial Schur's theorem
by: Kim, Jaehoon, et al.
Published: (2024)