Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions (Q2565683): Difference between revisions

@@ Property / arXiv ID @@
+math/0311449
@@ Property / arXiv ID: math/0311449 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing graphs: The packing problem solved
@@ Property / cites work: Packing graphs: The packing problem solved / rank @@
+Normal rank
@@ Property / cites work @@
+Near perfect coverings in graphs and hypergraphs
@@ Property / cites work: Near perfect coverings in graphs and hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5620621
@@ Property / cites work: Q5620621 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer and fractional packings in dense graphs
@@ Property / cites work: Integer and fractional packings in dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotically good list-colorings
@@ Property / cites work: Asymptotically good list-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+On a packing and covering problem
@@ Property / cites work: On a packing and covering problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083463
@@ Property / cites work: Q4083463 / rank @@
+Normal rank
@@ Property / cites work @@
+The decomposition threshold for bipartite graphs with minimum degree one
+Normal rank
@@ Property / cites work @@
+Integer and fractional packing of families of graphs
+Normal rank