On covering graphs by complete bipartite subgraphs (Q1025967): Difference between revisions

@@ Property / cites work @@
+Covering graphs by the minimum number of equivalence relations
+Normal rank
@@ Property / cites work @@
+Q5688995
@@ Property / cites work: Q5688995 / rank @@
+Normal rank
@@ Property / cites work @@
+Problems and results in extremal combinatorics. I.
+Normal rank
@@ Property / cites work @@
+Some structural properties of low-rank matrices related to computational complexity
+Normal rank
@@ Property / cites work @@
+On the coverings of graphs
@@ Property / cites work: On the coverings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Addressing Problem for Loop Switching
@@ Property / cites work: On the Addressing Problem for Loop Switching / rank @@
+Normal rank
@@ Property / cites work @@
+The Shrinkage Exponent of de Morgan Formulas is 2
@@ Property / cites work: The Shrinkage Exponent of de Morgan Formulas is 2 / rank @@
+Normal rank
@@ Property / cites work @@
+On Graph Complexity
@@ Property / cites work: On Graph Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On set intersection representations of graphs
@@ Property / cites work: On set intersection representations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional Covers and Communication Complexity
@@ Property / cites work: Fractional Covers and Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Method of determining lower bounds for the complexity of \(\Pi\)-circuits
+Normal rank
@@ Property / cites work @@
+Graph complexity and slice functions
@@ Property / cites work: Graph complexity and slice functions / rank @@
+Normal rank
@@ Property / cites work @@
+On the ratio of optimal integral and fractional covers
+Normal rank
@@ Property / cites work @@
+Applications of matrix methods to the theory of lower bounds in computational complexity
+Normal rank
@@ Property / cites work @@
+Bipartite Coverings of Graphs
@@ Property / cites work: Bipartite Coverings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3809266
@@ Property / cites work: Q3809266 / rank @@
+Normal rank
@@ Property / cites work @@
+On the fractional intersection number of a graph
@@ Property / cites work: On the fractional intersection number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
+Normal rank