Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three (Q4908832): Difference between revisions

@@ Property / cites work @@
+Decompositions of complete graphs into triangles and Hamilton cycles
+Normal rank
@@ Property / cites work @@
+Independence, clique size and maximum degree
@@ Property / cites work: Independence, clique size and maximum degree / rank @@
+Normal rank
@@ Property / cites work @@
+/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
+Normal rank
@@ Property / cites work @@
+Independent sets in triangle-free cubic planar graphs
+Normal rank
@@ Property / cites work @@
+Tight lower bounds on the size of a maximum matching in a regular graph
+Normal rank
@@ Property / cites work @@
+Independence in graphs with maximum degree four
@@ Property / cites work: Independence in graphs with maximum degree four / rank @@
+Normal rank
@@ Property / cites work @@
+Size and independence in triangle‐free graphs with maximum degree three
+Normal rank
@@ Property / cites work @@
+Hypergraph domination and strong independence
@@ Property / cites work: Hypergraph domination and strong independence / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
+Normal rank
@@ Property / cites work @@
+Perfect matchings in uniform hypergraphs with large minimum degree
+Normal rank
@@ Property / cites work @@
+Perfect matchings in large uniform hypergraphs with large minimum collective degree
+Normal rank