The biclique covering number of grids

zbMath1427.05174arXiv1811.03396MaRDI QIDQ2335697

Tony Huynh, Krystal Guo, Marco Macchia

Publication date: 15 November 2019

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

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

zbMATH Keywords

bipartite dimensionrectangle covering number .

Mathematics Subject Classification ID

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

Related Items (1)

Modeling combinatorial disjunctive constraints via junction trees

Uses Software

• SCIP

Cites Work

• Unnamed Item
• Unnamed Item
• Bipartite dimensions and bipartite degrees of graphs
• A mathematical analysis of human leukocyte antigen serology
• Extension complexity of stable set polytopes of bipartite graphs
• Biclique cover and local clique cover of graphs
• A short proof that the extension complexity of the correlation polytope grows exponentially
• On biclique coverings
• Applications of matrix methods to the theory of lower bounds in computational complexity
• Nearly Tight Approximability Results for Minimum Biclique Cover and Partition
• Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
• On the Addressing Problem for Loop Switching

This page was built for publication: The biclique covering number of grids