Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
JOHNSON, J. ROBERT
LEADER, IMRE
and
RUSSELL, PAUL A.
2015.
Set Systems Containing Many Maximal Chains.
Combinatorics, Probability and Computing,
Vol. 24,
Issue. 3,
p.
480.
Alon, Noga
Das, Shagnik
Glebov, Roman
and
Sudakov, Benny
2015.
Comparable pairs in families of sets.
Journal of Combinatorial Theory, Series B,
Vol. 115,
Issue. ,
p.
164.
Samotij, Wojciech
and
Sudakov, Benny
2015.
On the number of monotone sequences.
Journal of Combinatorial Theory, Series B,
Vol. 115,
Issue. ,
p.
132.
Patkós, Balázs
2015.
Supersaturation and stability for forbidden subposet problems.
Journal of Combinatorial Theory, Series A,
Vol. 136,
Issue. ,
p.
220.
Das, Shagnik
Gan, Wenying
and
Sudakov, Benny
2016.
The minimum number of disjoint pairs in set systems and related problems.
Combinatorica,
Vol. 36,
Issue. 6,
p.
623.
Collares, Maurício
and
Morris, Robert
2016.
Maximum-size antichains in random set-systems.
Random Structures & Algorithms,
Vol. 49,
Issue. 2,
p.
308.
SAMOTIJ, WOJCIECH
and
SUDAKOV, BENNY
2016.
The number of additive triples in subsets of abelian groups.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 160,
Issue. 3,
p.
495.
Noel, Jonathan A.
Scott, Alex
and
Sudakov, Benny
2018.
Supersaturation in posets and applications involving the container method.
Journal of Combinatorial Theory, Series A,
Vol. 154,
Issue. ,
p.
247.
Balogh, József
and
Wagner, Adam Zsolt
2018.
Kleitman's conjecture about families of given size minimizing the number of k-chains.
Advances in Mathematics,
Vol. 330,
Issue. ,
p.
229.
Das, Shagnik
Glebov, Roman
Sudakov, Benny
and
Tran, Tuan
2019.
Colouring set families without monochromatic k-chains.
Journal of Combinatorial Theory, Series A,
Vol. 168,
Issue. ,
p.
84.
Balogh, József
Petříčková, Šárka
and
Wagner, Adam Zsolt
2020.
Families in posets minimizing the number of comparable pairs.
Journal of Graph Theory,
Vol. 95,
Issue. 4,
p.
655.
Spink, Hunter
and
Tiba, Marius
2020.
Multicolor chain avoidance in the Boolean lattice.
European Journal of Combinatorics,
Vol. 87,
Issue. ,
p.
103135.
Gerbner, Dániel
Nagy, Dániel
Patkós, Balázs
and
Vizer, Máté
2021.
Extended Abstracts EuroComb 2021.
Vol. 14,
Issue. ,
p.
188.
O’Neill, Jason
2023.
A short note on supersaturation for oddtown and eventown.
Discrete Applied Mathematics,
Vol. 334,
Issue. ,
p.
63.