Ramsey numbers for bipartite graphs with small bandwidth
暂无分享,去创建一个
[1] J. Spencer. Ramsey Theory , 1990 .
[2] Vojtech Rödl,et al. Perfect Matchings in ε-Regular Graphs and the Blow-Up Lemma , 1999, Comb..
[3] Julia Böttcher,et al. Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs , 2009, Eur. J. Comb..
[4] Tomasz Łuczak,et al. R(Cn,Cn,Cn)≤(4+o(1))n , 1999 .
[5] Richard H. Schelp,et al. Path Ramsey numbers in multicolorings , 1975 .
[6] Vojtech Rödl,et al. Hypergraph Packing and Graph Embedding , 1999, Combinatorics, Probability and Computing.
[7] Edy Tri Baskoro,et al. On Ramsey-Type Problems , 2009 .
[8] S. Radziszowski. Small Ramsey Numbers , 2011 .
[9] Endre Szemerédi,et al. Three-Color Ramsey Numbers For Paths , 2007, Comb..
[10] Tomasz Luczak,et al. The Ramsey number for a triple of long even cycles , 2007, J. Comb. Theory, Ser. B.
[11] Vojtech Rödl,et al. The Ramsey number for hypergraph cycles I , 2006, J. Comb. Theory, Ser. A.
[12] Tomasz Luczak,et al. Ramsey Numbers for Trees of Small Maximum Degree , 2002, Comb..
[13] J. Pach,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[14] Endre Szemerédi,et al. Tripartite Ramsey numbers for paths , 2007, J. Graph Theory.
[15] E. Chong,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[16] S. Janson,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[17] M. Simonovits,et al. Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .
[18] E. Szemerédi. Regular Partitions of Graphs , 1975 .
[19] Endre Szemerédi,et al. Tripartite Ramsey numbers for paths , 2007 .
[20] M. Schacht,et al. Proof of the bandwidth conjecture of Bollobás and Komlós , 2009 .
[21] János Komlós,et al. Blow-up Lemma , 1997, Combinatorics, Probability and Computing.
[22] Jozef Skokan,et al. The 3-colored Ramsey number of even cycles , 2009, J. Comb. Theory, Ser. B.
[23] Endre Szemerédi,et al. Three-color Ramsey numbers for paths , 2008, Comb..
[24] János Komlós,et al. An algorithmic version of the blow-up lemma , 1998, Random Struct. Algorithms.
[25] Julia Böttcher,et al. Embedding into Bipartite Graphs , 2009, SIAM J. Discret. Math..
[26] P. Pálfy,et al. ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS, HUNGARIAN ACADEMY OF SCIENCES , 2014 .
[27] János Komlós,et al. The Regularity Lemma and Its Applications in Graph Theory , 2000, Theoretical Aspects of Computer Science.
[28] Graham R. Brightwell,et al. Ramsey-goodness—and otherwise , 2010, Comb..
[29] Gábor N. Sárközy,et al. An algorithmic version of the blow-up lemma , 1998 .