Imagen de Portada

A bounded diameter strengthening of Kőnig's Theorem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	DeBiasio, Louis, Girão, António, Haxell, Penny, Stein, Maya
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A note on the multicolor size-Ramsey numbers of connected graphs
por: DeBiasio, Louis
Publicado: (2024)

A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
por: Bal, Deepak, et al.
Publicado: (2023)

Large monochromatic components in expansive hypergraphs
por: Bal, Deepak, et al.
Publicado: (2023)

On the Ramsey numbers of wheels, cycles, and stars
por: DeBiasio, Louis, et al.
Publicado: (2026)

Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
por: DeBiasio, Louis, et al.
Publicado: (2025)

On the Ramsey numbers of fans and stars
por: DeBiasio, Louis, et al.
Publicado: (2026)

Unavoidable structures in infinite tournaments
por: Benford, Alistair, et al.
Publicado: (2023)

On the multicolor Ramsey numbers of balanced double stars
por: Bal, Deepak, et al.
Publicado: (2024)

Density of monochromatic infinite subgraphs II
por: Corsten, Jan, et al.
Publicado: (2020)

Constructing graphs with no independent transversals
por: Haxell, Penny, et al.
Publicado: (2023)

Powers of Hamilton cycles in oriented and directed graphs
por: DeBiasio, Louis, et al.
Publicado: (2024)

Partial independent transversals in multipartite graphs
por: Haxell, Penny, et al.
Publicado: (2025)

A multidimensional Ramsey Theorem
por: Girão, António, et al.
Publicado: (2022)

A Counterexample to a Conjecture of Lovász
por: Clow, Alexander, et al.
Publicado: (2025)

On the Determinant of Kőnig-Egerváry Graphs
por: Pereyra, Kevin
Publicado: (2026)

New bounds for linear arboricity and related problems
por: Christoph, Micha, et al.
Publicado: (2025)

Monochromatic odd cycles in edge-coloured complete graphs
por: Girão, António, et al.
Publicado: (2024)

Sparse Partitions of Graphs with Bounded Clique Number
por: Girão, António, et al.
Publicado: (2024)

Embedding induced trees in sparse expanding graphs
por: Girão, António, et al.
Publicado: (2024)

Induced subdivisions of $K_{d+1}$ in graphs of high girth
por: Girão, António, et al.
Publicado: (2026)

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

Cycles with almost linearly many chords
por: Draganić, Nemanja, et al.
Publicado: (2026)

Two Ramsey problems in blowups of graphs
por: Girão, António, et al.
Publicado: (2022)

Induced subdivisions in $K_{s,s}$-free graphs with polynomial average degree
por: Girão, António, et al.
Publicado: (2023)

Immersions of directed graphs in tournaments
por: Girão, António, et al.
Publicado: (2023)

Exact upper bounds for the minimum sizes of strong and weak separating path systems of cliques
por: Kontogeorgiou, George, et al.
Publicado: (2024)

A precise condition for independent transversals in bipartite covers
por: Cambie, Stijn, et al.
Publicado: (2023)

Oriented trees and paths in digraphs
por: Stein, Maya
Publicado: (2023)

On a conjecture that strengthens Kundu's $k$-factor Theorem
por: Shook, James M.
Publicado: (2022)

Open problems of the 33rd Workshop on Cycles and Colourings
por: Barát, János, et al.
Publicado: (2025)

Improved bound on the number of edges of diameter-$k$-critical graphs
por: Wang, Xiaolin, et al.
Publicado: (2024)

A common generalization to strengthenings of Drisko's Theorem for intersections of two matroids
por: Berger, Eli, et al.
Publicado: (2025)

Ordered Ramsey numbers of powers of paths
por: Girão, António, et al.
Publicado: (2024)

Blowups of triangle-free graphs
por: Girão, António, et al.
Publicado: (2024)

Small families of partially shattering permutations
por: Girão, António, et al.
Publicado: (2024)

The Dominating 4-Colour Theorem
por: Girão, António, et al.
Publicado: (2026)

On existence of integral point sets and their diameter bounds
por: Avdeev, Nikolai
Publicado: (2019)

An improved upper bound on the oriented diameter of graphs with diameter $4$
por: Lin, Jifu, et al.
Publicado: (2026)

A strengthened bound on the number of states required to characterize maximum parsimony distance
por: Fischer, Mareike, et al.
Publicado: (2025)

On upper bounds on the number of parts in the problem of partitioning sets into parts of smaller diameter
por: Bikeev, Arthur Igorevich, et al.
Publicado: (2025)