A note on odd cycle-complete graph Ramsey numbers.
Sudakov, Benny (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Holes in graphs.”
A note on odd cycle-complete graph Ramsey numbers.
Graphs with many copies of a given subgraph.
Nikiforov, Vladimir (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Extremal problems for -partite and -colorable hypergraphs.
Mubayi, Dhruv, Talbot, John (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The sum of degrees in cliques.
Bollobás, Béla, Nikiforov, Vladimir (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dense -free graphs are almost -partite.
Allen, Peter (2010)
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:
-free graphs of large minimum degree.
Alon, Noga, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Degree sequences of -free graphs.
Pikhurko, Oleg, Taraz, Anusch (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Turán density of the hypergraph .
Füredi, Zoltán, Pikhurko, Oleg, Simonovits, Miklós (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Uniquely -colorable and chromatically equivalent graphs.
Chao, Chong-Yun (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Perfect matchings in -regular graphs.
Alon, Noga, Rödl, Vojtěch, Ruciński, Andrzej (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edit distance and its computation.
Balogh, József, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Induced complete -partite graphs in dense clique-less graphs.
Fischer, Eldar (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity: