More on the Bipartite Decomposition of Random Graphs

DOI10.1002/jgt.22010zbMath1354.05120arXiv1409.6165OpenAlexW2224493628MaRDI QIDQ2958197

Hao Huang, Tom Bohman, Noga Alon

Publication date: 1 February 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.6165

zbMATH Keywords

random graphbipartite decomposition

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

An overview of graph covering and partitioning ⋮ Odd covers of graphs ⋮ A critical probability for biclique partition of \(G_{n,p}\) ⋮ On the decomposition of random hypergraphs ⋮ Addressing graph products and distance-regular graphs ⋮ Decomposition of Random Graphs into Complete Bipartite Graphs ⋮ On rainbow-cycle-forbidding edge colorings of finite graphs ⋮ Bipartite decomposition of random graphs

Cites Work

• Unnamed Item
• A new proof of a theorem of Graham and Pollak
• Variations on a theme of Graham and Pollak
• Bipartite decomposition of random graphs
• A polynomial space proof of the Graham-Pollak theorem
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• On the decomposition ofkn into complete bipartite graphs
• Cliques in random graphs
• Sharp bounds for decompositions of graphs into completer-partite subgraphs
• On the Addressing Problem for Loop Switching

This page was built for publication: More on the Bipartite Decomposition of Random Graphs