A critical probability for biclique partition of \(G_{n,p}\)
From MaRDI portal
Publication:6196153
DOI10.1016/j.jctb.2023.12.005arXiv2206.13490WikidataQ130132461 ScholiaQ130132461MaRDI QIDQ6196153
Publication date: 14 March 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.13490
Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of a theorem of Graham and Pollak
- Bipartite decomposition of random graphs
- The van den Berg-Kesten-Reimer operator and inequality for infinite spaces
- A polynomial space proof of the Graham-Pollak theorem
- Introduction to Random Graphs
- More on the Bipartite Decomposition of Random Graphs
- Some People Have All the Luck
- Inequalities with applications to percolation and reliability
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- On the decomposition ofkn into complete bipartite graphs
- Cliques in random graphs
- Paths in graphs
- Proof of the Van den Berg–Kesten Conjecture
- On the Addressing Problem for Loop Switching
- Decomposition of Random Graphs into Complete Bipartite Graphs
This page was built for publication: A critical probability for biclique partition of \(G_{n,p}\)
