:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	DeBiasio, Louis, Girão, António, Haxell, Penny, Stein, Maya
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2409.18250
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

Unavoidable structures in infinite tournaments
by: Benford, Alistair, et al.
Published: (2023)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Oriented trees and paths in digraphs
by: Stein, Maya
Published: (2023)

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

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

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

Janus Kinase Inhibitors for the Treatment of Pediatric Morphea: A Systematic Review
by: Alexa Moschella, et al.
Published: (2025)

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

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

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

Embedding Nearly Spanning Trees
by: Reed, Bruce, et al.
Published: (2024)