On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids (Q367058): Difference between revisions

@@ Property / cites work @@
+On the minimum size of tight hypergraphs
@@ Property / cites work: On the minimum size of tight hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-colorings of complete graphs that avoid polychromatic trees
+Normal rank
@@ Property / cites work @@
+Packing trees into planar graphs
@@ Property / cites work: Packing trees into planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Ramsey-type results for geometric graphs. I
@@ Property / cites work: Ramsey-type results for geometric graphs. I / rank @@
+Normal rank
@@ Property / cites work @@
+Q4842710
@@ Property / cites work: Q4842710 / rank @@
+Normal rank