Open AccessNearly complete graphs decomposable into large induced matchings and their applications
Author(s) -
Noga Alon,
Ankur Moitra,
Benny Sudakov
Publication year - 2013
Publication title -
journal of the european mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.549
H-Index - 64
eISSN - 1435-9863
pISSN - 1435-9855
DOI - 10.4171/jems/398
Subject(s) - mathematics , combinatorics , disjoint union (topology) , conjecture , disjoint sets , pairwise comparison , steiner tree problem , graph , cograph , rounding , discrete mathematics , matching (statistics) , chordal graph , 1 planar graph , computer science , statistics , operating system