Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Conlon, David
Fox, Jacob
and
Sudakov, Benny
2015.
Surveys in Combinatorics 2015.
p.
49.
Hegyvári, Norbert
2016.
Note on character sums of Hilbert cubes.
Journal of Number Theory,
Vol. 160,
Issue. ,
p.
526.
Conlon, David
Fox, Jacob
and
Sudakov, Benny
2016.
Short proofs of some extremal results II.
Journal of Combinatorial Theory, Series B,
Vol. 121,
Issue. ,
p.
173.
Dross, François
Montassier, Mickael
and
Pinlou, Alexandre
2016.
A lower bound on the order of the largest induced forest in planar graphs with high girth.
Discrete Applied Mathematics,
Vol. 214,
Issue. ,
p.
99.
Mubayi, Dhruv
and
Suk, Andrew
2018.
Constructions in Ramsey theory.
Journal of the London Mathematical Society,
Vol. 97,
Issue. 2,
p.
247.
Villarino, Mark B.
Gasarch, William
and
Regan, Kenneth W.
2018.
Hilbert’s Proof of His Irreducibility Theorem.
The American Mathematical Monthly,
Vol. 125,
Issue. 6,
p.
513.
Dross, François
Montassier, Mickael
and
Pinlou, Alexandre
2019.
Large induced forests in planar graphs with girth 4.
Discrete Applied Mathematics,
Vol. 254,
Issue. ,
p.
96.
Raigorodskii, A. M.
and
Cherkashin, D. D.
2020.
Extremal problems in hypergraph colourings.
Russian Mathematical Surveys,
Vol. 75,
Issue. 1,
p.
89.
Conlon, David
Fox, Jacob
and
Sudakov, Benny
2020.
Short proofs of some extremal results III.
Random Structures & Algorithms,
Vol. 57,
Issue. 4,
p.
958.
Mubayi, Dhruv
and
Suk, Andrew
2020.
Discrete Mathematics and Applications.
Vol. 165,
Issue. ,
p.
405.
Raigorodskii, Andrei Mikhailovich
and
Cherkashin, Danila Dmitrievich
2020.
Экстремальные задачи в раскрасках гиперграфов.
Успехи математических наук,
Vol. 75,
Issue. 1(451),
p.
95.
Hegyvári, Norbert
and
Pach, Péter Pál
2020.
Hilbert cubes meet arithmetic sets.
Journal of Number Theory,
Vol. 217,
Issue. ,
p.
292.
Zhou, Jiang
and
van Dam, Edwin R.
2021.
Spectral radius and clique partitions of graphs.
Linear Algebra and its Applications,
Vol. 630,
Issue. ,
p.
84.
Kamcev, Nina
Liebenau, Anita
Wood, David R.
and
Yepremyan, Liana
2021.
The Size Ramsey Number of Graphs with Bounded Treewidth.
SIAM Journal on Discrete Mathematics,
Vol. 35,
Issue. 1,
p.
281.
Barber, Ben
2021.
The Namer–Claimer game.
Discrete Mathematics,
Vol. 344,
Issue. 3,
p.
112256.
Schwartz, Stephan
2022.
An overview of graph covering and partitioning.
Discrete Mathematics,
Vol. 345,
Issue. 8,
p.
112884.
Guo, He
Patton, Kalen
and
Warnke, Lutz
2023.
Prague Dimension of Random Graphs.
Combinatorica,
Vol. 43,
Issue. 5,
p.
853.
Gunderson, Karen
Meagher, Karen
Morris, Joy
and
Pantangi, Venkata Raghu Tej
2024.
Induced forests in some distance-regular graphs.
Discrete Applied Mathematics,
Vol. 346,
Issue. ,
p.
290.