The Erd\H{o}s--Faber--Lov\'{a}sz Conjecture revisited (Q5027676): Difference between revisions

@@ Property / arXiv ID @@
+.00875
@@ Property / arXiv ID: 2103.00875 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Erd\"os-Faber-Lov\'asz Conjecture and edge coloring of complete graphs
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow triangles and cliques in edge-colored graphs
+Normal rank
@@ Property / cites work @@
+On the combinatorial problems which I would most like to see solved
+Normal rank
@@ Property / cites work @@
+Further results on Erdős–Faber–Lovász conjecture
+Normal rank
@@ Property / cites work @@
+A fractional version of the Erdős-Faber-Lovász conjecture
+Normal rank
@@ Property / cites work @@
+A remark on the conjecture of Erdös, Faber and Lovász
+Normal rank
@@ Property / cites work @@
+Monochromatic Clique Decompositions of Graphs
@@ Property / cites work: Monochromatic Clique Decompositions of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3070194
@@ Property / cites work: Q3070194 / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdős–Faber–Lovász conjecture is true for n ≤ 12
+Normal rank
@@ Property / cites work @@
+The Erdős-Faber-Lovász conjecture for dense hypergraphs
+Normal rank