Tur an Numbers of Bipartite Graphs and Related Ramsey-Type Questions

By Noga A Lon, M. K. Rivelevich, B. S. Udakov. 2003

57 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/43a1b6d19e518823a9a430333f712ffa23baa036

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Choongbum Lee

In Discrete Mathematics and Combinatorics

1. Choongbum Lee

Citations in the corpus

• MaxCut in ${\bm H)$-Free Graphs (2005, result): “To do so we have to combine the previous proof with the fact that the number of edges in any H -free graph on n vertices is at most c ( H ) n 3 / 2 , a result that follows from the main result of [16] (see also [5]).”
• Ramsey numbers of degenerate graphs (2015, methodology): “This weight function has been considered before by Alon, Krivelevich, and Su-dakov [2] with a fixed value of the threshold θ .”