Cover Image

Is it easy to regularize a hypergraph with easy links?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gishboliner, Lior, Shapira, Asaf, Wigderson, Yuval
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Hypergraph removal with polynomial bounds
by: Gishboliner, Lior, et al.
Published: (2022)

Polynomial Property Testing
by: Gishboliner, Lior, et al.
Published: (2025)

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

Hardness of Hypergraph Edge Modification Problems
by: Gishboliner, Lior, et al.
Published: (2025)

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

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

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

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

Disperse Hypergraphs
by: Gishboliner, Lior, et al.
Published: (2025)

Polynomial removal lemma for ordered matchings
by: Gishboliner, Lior, et al.
Published: (2023)

A Generalization of Varnavides's Theorem
by: Shapira, Asaf
Published: (2024)

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

Testing versus estimation of graph properties, revisited
by: Asaf Shapira, et al.
Published: (2024)

Steiner triple systems with high discrepancy
by: Gishboliner, Lior, et al.
Published: (2025)

The spanning tree spectrum: improved bounds and simple proofs
by: Alon, Noga, et al.
Published: (2025)

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

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

Subgraph discrepancies in the complete graph
by: Christoph, Micha, et al.
Published: (2026)

Tight Hamilton cycles with high discrepancy
by: Gishboliner, Lior, et al.
Published: (2023)

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

When does a tree activate the random graph?
by: Antonir, Asaf Cohen, et al.
Published: (2025)

Finding blowups one vertex at a time
by: Fox, Jacob, et al.
Published: (2026)

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

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

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

Defect and transference versions of the Alon-Frankl-Lovasz theorem
by: Gishboliner, Lior, et al.
Published: (2025)

Multicolor $K_r$-Tilings with High Discrepancy
by: Chan, Henry, et al.
Published: (2026)

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

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

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

Some easy optimization problems have the overlap-gap property
by: Li, Shuangping, et al.
Published: (2024)

Local limits of determinantal processes
by: Nachmias, Asaf, et al.
Published: (2025)

On Ramsey Properties of k-Majority Tournaments
by: Shapira, Asaf, et al.
Published: (2026)

Off-Diagonal Ramsey Numbers for Linear Hypergraphs
by: He, Xiaoyu, et al.
Published: (2025)

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

Larger Nearly Orthogonal Sets over Finite Fields
by: Haviv, Ishay, et al.
Published: (2024)

Embedding arbitrary edge-colorings of hypergraphs into regular colorings
by: Wang, Xiaomiao, et al.
Published: (2024)

Disproof of the Odd Hadwiger Conjecture
by: Kühn, Marcus, et al.
Published: (2025)