Some heterochromatic theorems for matroids (Q1660247): Difference between revisions

@@ Property / arXiv ID @@
+.08562
@@ Property / arXiv ID: 1708.08562 / rank @@
+Normal rank
@@ 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 @@
+Q3037460
@@ Property / cites work: Q3037460 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4075490
@@ Property / cites work: Q4075490 / rank @@
+Normal rank
@@ Property / cites work @@
+An analogue of the Erdős-Stone theorem for finite geometries
+Normal rank
@@ Property / cites work @@
+On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
+Normal rank
@@ Property / cites work @@
+An anti-Ramsey Theorem on edge-cutsets
@@ Property / cites work: An anti-Ramsey Theorem on edge-cutsets / rank @@
+Normal rank
@@ Property / cites work @@
+An anti-Ramsey theorem on cycles
@@ Property / cites work: An anti-Ramsey theorem on cycles / rank @@
+Normal rank
@@ Property / cites work @@
+On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids
+Normal rank
@@ Property / cites work @@
+Q3135082
@@ Property / cites work: Q3135082 / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic number of binary matroids
@@ Property / cites work: On the chromatic number of binary matroids / rank @@
+Normal rank
@@ Property / cites work @@
+Q4111952
@@ Property / cites work: Q4111952 / rank @@
+Normal rank