On the biclique cover of the complete graph

DOI10.1007/s00373-014-1493-2zbMath1327.05278arXiv1301.4790MaRDI QIDQ897237

Farokhlagha Moazami, Nasrin Soltankhah

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

multilinear polynomial; biclique cover; cross \(K\)-intersection families

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Biclique cover and local clique cover of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Covering complete hypergraphs with cuts of minimum total size
• Separating systems and oriented graphs of diameter two
• On separating systems
• Set systems with \(\mathcal L\)-intersections modulo a prime number
• Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families
• Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
• Covering a graph by complete bipartite graphs
• Some new bounds for cover-free families through biclique covers
• A sharp bound for the number of sets that pairwise intersect at \(k\) positive values
• Variations on a theme of Graham and Pollak
• On set intersection representations of graphs
• How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged?
• The biparticity of a graph
• Secure Frameproof Code Through Biclique Cover
• On the Addressing Problem for Loop Switching
• Covering a graph with cuts of minimum total size