Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Andrásfal, B.
1964.
Graphentheoretische Extremalprobleme.
Acta Mathematica Academiae Scientiarum Hungaricae,
Vol. 15,
Issue. 3-4,
p.
413.
Kalbfleisch, J. G.
1965.
Construction of Special Edge-Chromatic Graphs.
Canadian Mathematical Bulletin,
Vol. 8,
Issue. 5,
p.
575.
Florian, A.
1967.
Zur Geometrie der Kreislagerungen.
Acta Mathematica Academiae Scientiarum Hungaricae,
Vol. 18,
Issue. 3-4,
p.
341.
Erdős, P.
and
Hajnal, A.
1967.
On decomposition of graphs.
Acta Mathematica Academiae Scientiarum Hungaricae,
Vol. 18,
Issue. 3-4,
p.
359.
Irving, Robert W
1973.
On a bound of Graham and Spencer for a graph-coloring constant.
Journal of Combinatorial Theory, Series B,
Vol. 15,
Issue. 2,
p.
200.
Giraud, Guy
1983.
Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics.
Vol. 75,
Issue. ,
p.
303.
Bollobás, B.
and
Hind, H.R.
1991.
Graphs without large triangle free subgraphs.
Discrete Mathematics,
Vol. 87,
Issue. 2,
p.
119.
Erdős, P.
Hajnal, A.
Simonovits, M.
Sós, V. T.
and
Szemerédi, E.
1993.
Turán-Ramsey theorems and simple asymptotically extremal structures.
Combinatorica,
Vol. 13,
Issue. 1,
p.
31.
Linial, Nathan
1993.
Local-Global Phenomena in Graphs.
Combinatorics, Probability and Computing,
Vol. 2,
Issue. 4,
p.
491.
Krivelevich, Michael
1994.
Ks-Free Graphs Without Large Kr-Free Subgraphs.
Combinatorics, Probability and Computing,
Vol. 3,
Issue. 3,
p.
349.
Kurek, Andrzej
and
Ruciński, Andrzej
1994.
Globally sparse vertex‐ramsey graphs.
Journal of Graph Theory,
Vol. 18,
Issue. 1,
p.
73.
Krivelevich, Michael
1995.
Bounding Ramsey numbers through large deviation inequalities.
Random Structures & Algorithms,
Vol. 7,
Issue. 2,
p.
145.
Alon, Noga
and
Krivelevich, Michael
1997.
Constructive Bounds for a Ramsey-Type Problem.
Graphs and Combinatorics,
Vol. 13,
Issue. 3,
p.
217.
Krivelevich, Michael
1997.
On the minimal number of edges in color-critical graphs.
Combinatorica,
Vol. 17,
Issue. 3,
p.
401.
Bang‐Jensen, Jorgen
and
Brandt, Stephan
2004.
Subgraphs in vertex neighborhoods of Kr‐free graphs.
Journal of Graph Theory,
Vol. 47,
Issue. 1,
p.
29.
Sudakov, Benny
2005.
Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems.
Random Structures & Algorithms,
Vol. 26,
Issue. 3,
p.
253.
Dudek, Andrzej
and
Rödl, Vojtěch
2010.
An almost quadratic bound on vertex Folkman numbers.
Journal of Combinatorial Theory, Series B,
Vol. 100,
Issue. 2,
p.
132.
Dudek, Andrzej
and
Rödl, Vojtěch
2011.
On K s -free subgraphs in K s+k -free graphs and vertex Folkman numbers.
Combinatorica,
Vol. 31,
Issue. 1,
p.
39.
Fox, Jacob
and
Sudakov, Benny
2011.
Dependent random choice.
Random Structures & Algorithms,
Vol. 38,
Issue. 1-2,
p.
68.
Dudek, Andrzej
and
Rödl, Vojtěch
2011.
Ramsey Theory.
p.
63.