Cover Image

Counting subgraphs in locally dense graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bradač, Domagoj, Sudakov, Benny, Wigderson, Yuval
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

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)

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

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

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

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

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)

Unique subgraphs are rare
by: Bradač, Domagoj, et al.
Published: (2024)

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

On a question of Erdős and Nešetřil about minimal cuts in a graph
by: Bradač, Domagoj
Published: (2024)

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

Counting sparse induced subgraphs in locally dense graphs
by: Nenadov, Rajko
Published: (2024)

Infinitely many minimally non-Ramsey size-linear graphs
by: Wigderson, Yuval
Published: (2024)

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

Nearly tight exponents for off-diagonal Ramsey numbers
by: Bradač, Domagoj
Published: (2026)

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

Upper bounds on diagonal Ramsey numbers [after Campos, Griffiths, Morris, and Sahasrabudhe]
by: Wigderson, Yuval
Published: (2024)

Ramsey numbers upon vertex deletion
by: Wigderson, Yuval
Published: (2022)

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

Counting spanning subgraphs in dense hypergraphs
by: Montgomery, Richard, et al.
Published: (2023)

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

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

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

Asymmetric results about graph homomorphisms
by: Gishboliner, Lior, et al.
Published: (2025)

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

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

Oriented Ramsey numbers of graded digraphs
by: Morawski, Patryk, et al.
Published: (2024)

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

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

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

Weighted Turán theorems with applications to Ramsey-Turán type of problems
by: Balogh, József, et al.
Published: (2023)

The inertia bound is far from tight
by: Kwan, Matthew, et al.
Published: (2023)

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

Jacobian graphs
by: Forey, Arthur, et al.
Published: (2026)

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

Long induced paths in $K_{s, s}$-free graphs
by: Hunter, Zach, et al.
Published: (2024)

An efficient asymmetric removal lemma and its limitations
by: Gishboliner, Lior, et al.
Published: (2023)

Regularity for hypergraphs with bounded VC$_2$ dimension
by: Gishboliner, Lior, et al.
Published: (2025)

Is it easy to regularize a hypergraph with easy links?
by: Gishboliner, Lior, et al.
Published: (2025)