Proof of a tiling conjecture of Komlós (Q4434471): Difference between revisions

@@ Property / cites work @@
+Almost \(H\)-factors in dense graphs
@@ Property / cites work: Almost \(H\)-factors in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+\(H\)-factors in dense graphs
@@ Property / cites work: \(H\)-factors in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximal number of independent circuits in a graph
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On circuits in graphs
@@ Property / cites work: On circuits in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tiling Turán theorems
@@ Property / cites work: Tiling Turán theorems / rank @@
+Normal rank
@@ Property / cites work @@
+Blow-up lemma
@@ Property / cites work: Blow-up lemma / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic version of the blow-up lemma
@@ Property / cites work: An algorithmic version of the blow-up lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Proof of the Alon-Yuster conjecture
@@ Property / cites work: Proof of the Alon-Yuster conjecture / rank @@
+Normal rank