Cover Image

Acyclic subgraphs of tournaments with high chromatic number

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fox, Jacob, Kwan, Matthew, Sudakov, Benny
Format:	Preprint
Published:	2019
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Acyclic subgraphs of digraphs with high chromatic number
by: Yuster, Raphael
Published: (2025)

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

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

Chromatic number and regular subgraphs
by: Janzer, Barnabás, et al.
Published: (2024)

Cyclic subsets of tournaments
by: Hunter, Zach, et al.
Published: (2025)

Packing subgraphs in regular graphs
by: Letzter, Shoham, et al.
Published: (2025)

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

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

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

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

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

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

Ordered Ramsey numbers of graphs with $m$ edges
by: Bradač, Domagoj, et al.
Published: (2024)

Ramsey numbers of digraphs with local edge structure
by: Bradač, Domagoj, et al.
Published: (2025)

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

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

Variations on Sidorenko's conjecture in tournaments
by: Fox, Jacob, et al.
Published: (2024)

The largest subgraph without a forbidden induced subgraph
by: Fox, Jacob, et al.
Published: (2024)

Gaussian random graphs and Ramsey numbers
by: Hunter, Zach, et al.
Published: (2025)

Canonical Ramsey numbers of sparse graphs
by: Gishboliner, Lior, et al.
Published: (2024)

Coloring small locally sparse degenerate graphs and related problems
by: Bradač, Domagoj, et al.
Published: (2026)

The Helly number of Hamming balls and related problems
by: Alon, Noga, et al.
Published: (2024)

Extremal, enumerative and probabilistic results on ordered hypergraph matchings
by: Anastos, Michael, et al.
Published: (2023)

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

Nearly Hamilton cycles in sublinear expanders, and applications
by: Letzter, Shoham, et al.
Published: (2025)

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

Chromatic number and regular subgraphs
by: Barnabás Janzer, et al.
Published: (2025)

Induced subgraph density. II. Sparse and dense sets in cographs
by: Fox, Jacob, et al.
Published: (2023)

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

Maximum odd induced subgraph of a graph concerning its chromatic number
by: Wang, Tao, et al.
Published: (2022)

Approximate path decompositions of regular graphs
by: Montgomery, Richard, et al.
Published: (2024)

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

Computing the clique number of tournaments
by: Aubian, Guillaume
Published: (2024)

The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes
by: Christoph, Micha, et al.
Published: (2026)

Minimum non-chromatic-choosable graphs with given chromatic number
by: Zhu, Jialu, et al.
Published: (2022)

Set mappings for general graphs
by: Gishboliner, Lior, et al.
Published: (2026)

Communication Complexity of Disjointness under Product Distributions
by: Hunter, Zach, et al.
Published: (2026)

Proof of Thomassen's Conjecture on Highly connected subgraphs with large chromatic number
by: Polavarapu, Achintya Raya
Published: (2026)

The number of cliques in hypergraphs with forbidden subgraphs
by: Basu, Ayush, et al.
Published: (2024)