Nearly complete graphs decomposable into large induced matchings and their applications

DOI10.4171/JEMS/398zbMath1278.05183MaRDI QIDQ363228

Noga Alon, Ankur Moitra, Benjamin Sudakov

Publication date: 2 September 2013

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

zbMATH Keywords

induced matchings; Ruzsa-Szemerédi graphs; testing linearity

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)