The order of monochromatic subgraphs with a given minimum degree.
Caro, Yair, Yuster, Raphael (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A note on the Folkman number $F(3,3;5)$”
The order of monochromatic subgraphs with a given minimum degree.
Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory
Štefan Znám (1967)
Matematický časopis
Similarity:
Fruit salad.
Gyárfás, András (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Complete and pseudocomplete colourings of a graph
Juraj Bosák, Jaroslav Nešetřil (1976)
Mathematica Slovaca
Similarity:
On graphs containing many subgraphs with the same number of edges
Jozef Širáň (1980)
Mathematica Slovaca
Similarity: