On the size of graphs with complete-factors
From MaRDI portal
Publication:3722537
DOI10.1002/jgt.3190090117zbMath0593.05042OpenAlexW1988131991MaRDI QIDQ3722537
Publication date: 1985
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190090117
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (22)
On deficiency problems for graphs ⋮ Sizes and transmissions of digraphs with a given clique number ⋮ Factors and factorizations of graphs—a survey ⋮ On the sum of sizes of overlapping families ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ On the maximum number of edges in hypergraphs with fixed matching and clique number ⋮ The formula for Turán number of spanning linear forests ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ On families with bounded matching number ⋮ Spectral radius and rainbow matchings of graphs ⋮ The maximum spectral radius of graphs without spanning linear forests ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ A proof of Frankl–Kupavskii's conjecture on edge‐union condition ⋮ A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem ⋮ Generalization of Erdős-Gallai edge bound ⋮ Rainbow matchings in properly-colored hypergraphs ⋮ Cross-intersecting pairs of hypergraphs ⋮ Mixed matchings in graphs ⋮ Beyond the Erdős matching conjecture ⋮ The shifting method and generalized Turán number of matchings ⋮ On the size of the product of overlapping families ⋮ On the rainbow matching conjecture for 3-uniform hypergraphs
This page was built for publication: On the size of graphs with complete-factors
