Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Linial, Nati
and
Morgenstern, Avraham
2015.
Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal.
Journal of Graph Theory,
Vol. 78,
Issue. 3,
p.
229.
Glebov, Roman
Grzesik, Andrzej
Klimošová, Tereza
and
Král', Daniel
2015.
Finitely forcible graphons and permutons.
Journal of Combinatorial Theory, Series B,
Vol. 110,
Issue. ,
p.
112.
BALOGH, JÓZSEF
HU, PING
LIDICKÝ, BERNARD
PIKHURKO, OLEG
UDVARI, BALÁZS
and
VOLEC, JAN
2015.
Minimum Number of Monotone Subsequences of Length 4 in Permutations.
Combinatorics, Probability and Computing,
Vol. 24,
Issue. 4,
p.
658.
Falgas--Ravry, Victor
Marchant, Edward
Pikhurko, Oleg
and
Vaughan, Emil R.
2015.
The Codegree Threshold for 3-Graphs with Independent Neighborhoods.
SIAM Journal on Discrete Mathematics,
Vol. 29,
Issue. 3,
p.
1504.
Balogh, József
Hu, Ping
Lidický, Bernard
and
Pfender, Florian
2016.
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle.
European Journal of Combinatorics,
Vol. 52,
Issue. ,
p.
47.
Huang, Hao
Linial, Nati
Naves, Humberto
Peled, Yuval
and
Sudakov, Benny
2016.
On the densities of cliques and independent sets in graphs.
Combinatorica,
Vol. 36,
Issue. 5,
p.
493.
Alon, Noga
Naves, Humberto
and
Sudakov, Benny
2016.
On the Maximum Quartet Distance between Phylogenetic Trees.
SIAM Journal on Discrete Mathematics,
Vol. 30,
Issue. 2,
p.
718.
PIKHURKO, OLEG
and
RAZBOROV, ALEXANDER
2017.
Asymptotic Structure of Graphs with the Minimum Number of Triangles.
Combinatorics, Probability and Computing,
Vol. 26,
Issue. 1,
p.
138.
Hladký, Jan
Král’, Daniel
and
Norin, Sergey
2017.
Counting flags in triangle-free digraphs.
Combinatorica,
Vol. 37,
Issue. 1,
p.
49.
Balogh, József
Hu, Ping
Lidický, Bernard
Pfender, Florian
Volec, Jan
and
Young, Michael
2017.
Rainbow triangles in three-colored graphs.
Journal of Combinatorial Theory, Series B,
Vol. 126,
Issue. ,
p.
83.
Nagami Coregliano, Leonardo
2018.
Quasi‐carousel tournaments.
Journal of Graph Theory,
Vol. 88,
Issue. 1,
p.
192.
Cooper, Jacob W.
Král', Daniel
and
Martins, Taísa L.
2018.
Finitely forcible graph limits are universal.
Advances in Mathematics,
Vol. 340,
Issue. ,
p.
819.
Grzesik, Andrzej
Hu, Ping
and
Volec, Jan
2019.
Minimum number of edges that occur in odd cycles.
Journal of Combinatorial Theory, Series B,
Vol. 137,
Issue. ,
p.
65.
Balogh, József
Lidický, Bernard
and
Salazar, Gelasio
2019.
Closing in on Hill's Conjecture.
SIAM Journal on Discrete Mathematics,
Vol. 33,
Issue. 3,
p.
1261.
Glebov, Roman
Klimošová, Tereza
and
Král', Daniel
2019.
Infinite‐dimensional finitely forcible graphon.
Proceedings of the London Mathematical Society,
Vol. 118,
Issue. 4,
p.
826.
Pikhurko, Oleg
Sliačan, Jakub
and
Tyros, Konstantinos
2019.
Strong forms of stability from flag algebra calculations.
Journal of Combinatorial Theory, Series B,
Vol. 135,
Issue. ,
p.
129.
Grzesik, Andrzej
Král, Daniel
and
Lovász, László Miklós
2020.
Elusive extremal graphs.
Proceedings of the London Mathematical Society,
Vol. 121,
Issue. 6,
p.
1685.
Sawin, Will
2022.
An improved lower bound for multicolor Ramsey numbers and a problem of Erdős.
Journal of Combinatorial Theory, Series A,
Vol. 188,
Issue. ,
p.
105579.
Parczyk, Olaf
Pokutta, Sebastian
Spiegel, Christoph
and
Szabó, Tibor
2024.
New Ramsey Multiplicity Bounds and Search Heuristics.
Foundations of Computational Mathematics,