Let \tau(G) be the minimum number of pairwise edge-disjoint complete bipartite subgraphs partitioning E(G), and let \beta(G) be the largest order of an induced complete…
Statement
Let \tau(G) be the minimum number of pairwise edge-disjoint complete bipartite subgraphs partitioning E(G), and let \beta(G) be the largest order of an induced complete bipartite subgraph. For G\sim G(n,0.5), is \tau(G)=n-\beta(G)+1 with high probability?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.