Unavoidable Subtournaments in Large Tournaments with No Homogeneous Sets (Q5346549): Difference between revisions

@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Typical subgraphs of 3- and 4-connected graphs
@@ Property / cites work: Typical subgraphs of 3- and 4-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Unavoidable doubly connected large graphs
@@ Property / cites work: Unavoidable doubly connected large graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Unavoidable vertex-minors in large prime graphs
@@ Property / cites work: Unavoidable vertex-minors in large prime graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Unavoidable induced subgraphs in large graphs with no homogeneous sets
+Normal rank
@@ Property / cites work @@
+The Voting Problem
@@ Property / cites work: The Voting Problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdös-Hajnal Conjecture-A Survey
@@ Property / cites work: The Erdös-Hajnal Conjecture-A Survey / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/15m1043911
+Normal rank
@@ Property / OpenAlex ID @@
+W2605244699
@@ Property / OpenAlex ID: W2605244699 / rank @@
+Normal rank