On graphs decomposable into induced matchings of linear sizes

DOI10.1112/blms.12005zbMath1370.05101arXiv1512.07852OpenAlexW2964023005MaRDI QIDQ5357047

Hao Huang, Jacob Fox, Benjamin Sudakov

Publication date: 13 September 2017

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.07852

zbMATH Keywords

\((r,t)\)-Ruzsa-Szemerédi graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Induced Ramsey number for a star versus a fixed graph ⋮ Minimum degree and the graph removal lemma ⋮ Colorings with only rainbow arithmetic progressions ⋮ Triple systems with no three triples spanning at most five points

This page was built for publication: On graphs decomposable into induced matchings of linear sizes