Imagen de Portada

Nearly Hamilton cycles in sublinear expanders, and applications

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Letzter, Shoham, Methuku, Abhishek, Sudakov, Benny
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Nearly Hamilton cycles in sublinear expanders and applications
por: Shoham Letzter, et al.
Publicado: (2026)

Packing subgraphs in regular graphs
por: Letzter, Shoham, et al.
Publicado: (2025)

Sublinear expanders and their applications
por: Letzter, Shoham
Publicado: (2024)

Exact supported co-degree bounds for Hamilton cycles
por: Letzter, Shoham, et al.
Publicado: (2025)

Hamiltonicity of expanders: optimal bounds and applications
por: Draganić, Nemanja, et al.
Publicado: (2024)

Power saving for the Brown-Erdős-Sós problem
por: Janzer, Oliver, et al.
Publicado: (2023)

Hamiltonicity of regular sublinear expanders
por: Bradač, Domagoj, et al.
Publicado: (2026)

Directed cycles with zero weight in $\mathbb{Z}_p^k$
por: Letzter, Shoham, et al.
Publicado: (2023)

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

Separating paths systems of almost linear size
por: Letzter, Shoham
Publicado: (2022)

Chi-boundedness of graphs containing no cycles with $k$ chords
por: Lee, Joonkyung, et al.
Publicado: (2022)

Restricted subgraphs of edge-colored graphs and applications
por: Sudakov, Benny
Publicado: (2024)

Partitioning a tournament into sub-tournaments of high connectivity
por: Girão, António, et al.
Publicado: (2022)

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

Building graphs with high minimum degree on a budget
por: Katsamaktsis, Kyriakos, et al.
Publicado: (2024)

Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
por: Draganić, Nemanja, et al.
Publicado: (2025)

Size-Ramsey numbers of tight paths
por: Letzter, Shoham, et al.
Publicado: (2025)

On the gracesize of trees
por: Letzter, Shoham, et al.
Publicado: (2025)

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

Edge-disjoint cycles with the same vertex set
por: Chakraborti, Debsoumya, et al.
Publicado: (2024)

On the Turán number of the hypercube
por: Janzer, Oliver, et al.
Publicado: (2022)

Induced Ramsey problems for trees and graphs with bounded treewidth
por: Hunter, Zach, et al.
Publicado: (2024)

Improved bounds for the Erdős-Rogers $(s,s+2)$-problem
por: Janzer, Oliver, et al.
Publicado: (2023)

Decomposing cubic graphs into isomorphic linear forests
por: Kronenberg, Gal, et al.
Publicado: (2022)

New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs
por: Kang, Dong Yeap, et al.
Publicado: (2020)

Tight bounds for intersection-reverse sequences, edge-ordered graphs and applications
por: Janzer, Barnabás, et al.
Publicado: (2024)

Independent sets and colorings of $K_{t,t,t}$-free graphs
por: Dhawan, Abhishek, et al.
Publicado: (2025)

$C_4$-free subgraphs of high degree with geometric applications
por: Hunter, Zach, et al.
Publicado: (2025)

Color-avoiding directed paths in tournaments
por: Fox, Jacob, et al.
Publicado: (2025)

Lower bounds for Ramsey numbers of bounded degree hypergraphs
por: Bradač, Domagoj, et al.
Publicado: (2025)

Bounded-degree spanning trees in randomly perturbed graphs
por: Krivelevich, Michael, et al.
Publicado: (2015)

Induced subgraphs of $K_r$-free graphs and the Erdős--Rogers problem
por: Gishboliner, Lior, et al.
Publicado: (2024)

The growth rate of multicolor Ramsey numbers of $3$-graphs
por: Bradač, Domagoj, et al.
Publicado: (2023)

Counting subgraphs in locally dense graphs
por: Bradač, Domagoj, et al.
Publicado: (2024)

Two Erdos-Hajnal-type theorems for forbidden order-size pairs
por: Arnold, Fabian, et al.
Publicado: (2024)

Acyclic subgraphs of tournaments with high chromatic number
por: Fox, Jacob, et al.
Publicado: (2019)

Incidence bounds via extremal graph theory
por: Milojević, Aleksa, et al.
Publicado: (2024)

Near rainbow Hamilton cycles in dense graphs
por: Peng, Danni, et al.
Publicado: (2024)

The rainbow saturation number is linear
por: Behague, Natalie, et al.
Publicado: (2022)

Cyclic subsets of tournaments
por: Hunter, Zach, et al.
Publicado: (2025)