On graphs with prescribed subgraphs of order , and a theorem of Kelly and Merriell
Yair Caro (1994)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “A ramsey-type theorem for multiple disjoint copies of induced subgraphs”
On graphs with prescribed subgraphs of order , and a theorem of Kelly and Merriell
An asymptotic result for the path partition conjecture.
Frick, Marietjie, Schiermeyer, Ingo (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Upper and lower bounds for .
Xu, Xiaodong, Luo, Haipeng, Shao, Zehui (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gradual partition of a graph into complete graphs
Josef Voldřich (1978)
Časopis pro pěstování matematiky
Similarity:
Universality in Graph Properties with Degree Restrictions
Izak Broere, Johannes Heidema, Peter Mihók (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Rado constructed a (simple) denumerable graph R with the positive integers as vertex set with the following edges: For given m and n with m < n, m is adjacent to n if n has a 1 in the m’th position of its binary expansion. It is well known that R is a universal graph in the set [...] of all countable graphs (since every graph in [...] is isomorphic to an induced subgraph of R). A brief overview of known universality results for some induced-hereditary subsets of [...] is provided....
A note on domatically critical and cocritical graphs
Igor Edmundovich Zverovich, Vadim E. Zverovich (1991)
Czechoslovak Mathematical Journal
Similarity: