\(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110): Difference between revisions

@@ Property / Wikidata QID @@
+Q123242105
@@ Property / Wikidata QID: Q123242105 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
+Normal rank
@@ Property / cites work @@
+Q4101818
@@ Property / cites work: Q4101818 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3905312
@@ Property / cites work: Q3905312 / rank @@
+Normal rank
@@ Property / cites work @@
+On the combinatorial problems which I would most like to see solved
+Normal rank
@@ Property / cites work @@
+On a Conjecture of Erdös, Faber, and Lovász about <i>n</i>-Colorings
+Normal rank
@@ Property / cites work @@
+The b-chromatic number of a graph
@@ Property / cites work: The b-chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the Erdős--Farber--Lovász conjecture
@@ Property / cites work: A note on the Erdős--Farber--Lovász conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
+Normal rank
@@ Property / cites work @@
+Q4414507
@@ Property / cites work: Q4414507 / rank @@
+Normal rank
@@ Property / cites work @@
+b-coloring of m-tight graphs
@@ Property / cites work: b-coloring of m-tight graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdős-Faber-Lovász conjecture for dense hypergraphs
+Normal rank