Regarding two conjectures on clique and biclique partitions

DOI10.37236/9564zbMath1486.05250arXiv2005.02529OpenAlexW3023014247MaRDI QIDQ2121747

Dhruv Rohatgi, John C. Urschel, Jake L. Wellens

Publication date: 4 April 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

extremal problemclique covering numberclique partition numbercomplementary graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

An overview of graph covering and partitioning ⋮ Finding biclique partitions of co-chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A counterexample to the Alon-Saks-Seymour conjecture and related problems
• Integer and fractional packings in dense graphs
• On covering graphs by complete bipartite subgraphs
• Clique covering of graphs
• Hardness vs randomness
• Some recent problems and results in graph theory
• Fruit salad
• Extremal clique coverings of complementary graphs
• Variations on a theme of Graham and Pollak
• Clique coverings and claw-free graphs
• Packing triangles in a graph and its complement
• Clique coverings of graphs V: maximal-clique partitions
• Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
• Integer and fractional packing of families of graphs
• The Representation of a Graph by Set Intersections
• On the Addressing Problem for Loop Switching
• Edge disjoint monochromatic triangles in 2-colored graphs

This page was built for publication: Regarding two conjectures on clique and biclique partitions