Edge-colorings of complete graphs that avoid polychromatic trees (Q1421517): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2003.09.002
@@ Property / DOI: 10.1016/j.disc.2003.09.002 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2003.09.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2101857785
@@ Property / OpenAlex ID: W2101857785 / rank @@
+Normal rank
@@ Property / cites work @@
+On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
+Normal rank
@@ Property / cites work @@
+Q5463539
@@ Property / cites work: Q5463539 / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal paths and circuits of graphs
@@ Property / cites work: On maximal paths and circuits of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5567712
@@ Property / cites work: Q5567712 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-colorings with no large polychromatic stars
@@ Property / cites work: Edge-colorings with no large polychromatic stars / rank @@
+Normal rank
@@ Property / cites work @@
+On restricted colourings of \(K_ n\)
@@ Property / cites work: On restricted colourings of \(K_ n\) / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2003.09.002
@@ Property / DOI: 10.1016/J.DISC.2003.09.002 / rank @@
+Normal rank