On set intersection representations of graphs (Q3633007): Difference between revisions

@@ Property / DOI @@
-.1002/jgt.20367
@@ Property / DOI: 10.1002/jgt.20367 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.20367
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20367 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4214604286
@@ Property / OpenAlex ID: W4214604286 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering graphs by the minimum number of equivalence relations
+Normal rank
@@ Property / cites work @@
+A counterexample to the rank-coloring conjecture
@@ Property / cites work: A counterexample to the rank-coloring conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Circuits over $\operatorname{GF}(2)$
@@ Property / cites work: Linear Circuits over $\operatorname{GF}(2)$ / rank @@
+Normal rank
@@ Property / cites work @@
+The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
+Normal rank
@@ Property / cites work @@
+Onp-intersection representations
@@ Property / cites work: Onp-intersection representations / rank @@
+Normal rank
@@ Property / cites work @@
+Set intersection representations for almost all graphs
+Normal rank
@@ Property / cites work @@
+Graphs of small dimensions
@@ Property / cites work: Graphs of small dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+The Representation of a Graph by Set Intersections
+Normal rank
@@ Property / cites work @@
+Covering a graph by complete bipartite graphs
@@ Property / cites work: Covering a graph by complete bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Covering the edges of a random graph by cliques
@@ Property / cites work: Covering the edges of a random graph by cliques / 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 power of the middle bit of a \(\#\)P function
@@ Property / cites work: The power of the middle bit of a \(\#\)P function / rank @@
+Normal rank
@@ Property / cites work @@
+On Graph Complexity
@@ Property / cites work: On Graph Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On covering graphs by complete bipartite subgraphs
+Normal rank
@@ Property / cites work @@
+Graph complexity and slice functions
@@ Property / cites work: Graph complexity and slice functions / rank @@
+Normal rank
@@ Property / cites work @@
+Modular intersection graphs
@@ Property / cites work: Modular intersection graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On rank vs. communication complexity
@@ Property / cites work: On rank vs. communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+A Bound for the Chromatic Number of a Graph
@@ Property / cites work: A Bound for the Chromatic Number of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Some combinatorial-algebraic problems from complexity theory
+Normal rank
@@ Property / cites work @@
+Q5465363
@@ Property / cites work: Q5465363 / rank @@
+Normal rank
@@ Property / cites work @@
+On the ``log rank''-conjecture in communication complexity
+Normal rank
@@ Property / cites work @@
+The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
+Normal rank
@@ Property / cites work @@
+Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
+Normal rank
@@ Property / cites work @@
+The log-rank conjecture and low degree polynomials
+Normal rank
@@ Property / DOI @@
+.1002/JGT.20367
@@ Property / DOI: 10.1002/JGT.20367 / rank @@
+Normal rank