Maximum bipartite subgraphs of Kneser graphs (Q1121290): Difference between revisions

@@ Property / cites work @@
+Graphs with maximal number of adjacent pairs of edges
+Normal rank
@@ Property / cites work @@
+Facets of the Bipartite Subgraph Polytope
@@ Property / cites work: Facets of the Bipartite Subgraph Polytope / rank @@
+Normal rank
@@ Property / cites work @@
+A short proof of Kneser's conjecture
@@ Property / cites work: A short proof of Kneser's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Non-trivial intersecting families
@@ Property / cites work: Non-trivial intersecting families / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Near-Optimal Graph Coloring
@@ Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangle-free partial graphs and edge covering theorems
+Normal rank
@@ Property / cites work @@
+Kneser's conjecture, chromatic number, and homotopy
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem
+Normal rank