Perfect matchings in \(\varepsilon\)-regular graphs
From MaRDI portal
Publication:1380203
zbMath0886.05088MaRDI QIDQ1380203
Noga Alon, Vojtěch Rödl, Andrzej Ruciński
Publication date: 5 March 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119304
Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree, Strong edge colorings of uniform graphs, Perfect matchings in uniform hypergraphs with large minimum degree, Colorings with few colors: counting, enumeration and combinatorial bounds, Enumerating coprime permutations, Interval colorings of graphs—Coordinated and unstable no‐wait schedules, Random perfect matchings in regular graphs, A blow-up lemma for approximate decompositions, On the threshold problem for Latin boxes, Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs
