The decomposition threshold for bipartite graphs with minimum degree one
From MaRDI portal
Publication:4803312
DOI10.1002/rsa.10044zbMath1018.05090OpenAlexW2001495941MaRDI QIDQ4803312
Publication date: 2 April 2003
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10044
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (9)
Fractional Triangle Decompositions in Graphs with Large Minimum Degree ⋮ Fractional clique decompositions of dense graphs and hypergraphs ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Edge-decompositions of graphs with high minimum degree ⋮ Edge-decompositions of graphs with high minimum degree ⋮ Decomposing dense bipartite graphs into 4-cycles ⋮ Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions ⋮ On the decomposition threshold of a given graph ⋮ Decomposing Graphs of High Minimum Degree into 4‐Cycles
Cites Work
This page was built for publication: The decomposition threshold for bipartite graphs with minimum degree one
