Trees with three leaves are (\(n+1\))-unavoidable (Q1827852): Difference between revisions

@@ Property / cites work @@
+Trees in tournaments
@@ Property / cites work: Trees in tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Trees in tournaments
@@ Property / cites work: Trees in tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+On unavoidability of trees with \(k\) leaves
@@ Property / cites work: On unavoidability of trees with \(k\) leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
+Normal rank
@@ Property / cites work @@
+Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
+Normal rank
@@ Property / cites work @@
+On avoidable and unavoidable claws
@@ Property / cites work: On avoidable and unavoidable claws / rank @@
+Normal rank
@@ Property / cites work @@
+Q3950574
@@ Property / cites work: Q3950574 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths and Cycles in Tournaments
@@ Property / cites work: Paths and Cycles in Tournaments / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0166-218x(03)00366-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1976444262
@@ Property / OpenAlex ID: W1976444262 / rank @@
+Normal rank