Nearly complete graphs decomposable into large induced matchings and their applications
Work
Year: 2012
Type: article
Abstract: We describe two constructions of (very) dense graphs which are edge disjoint unions of large induced matchings. The first construction exhibits graphs on N vertices with (N2)-o(N2) edges, which can be... more
Authors Noga Alon, Ankur Moitra, Benny Sudakov
Institutions Tel Aviv University, Institute for Advanced Study, University of California, Los Angeles
Cites: 23
Cited by: 45
Related to: 10
FWCI: 1.66
Citation percentile (by year/subfield): 96.63
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Sustainable cities and communities
Open Access status: green