8 citations · 8 across the 1 of their papers we have counts for
3 papers
math.CO2017
Families in posets minimizing the number of comparable pairs
Jozsef Balogh, Sarka Petrickova, Adam Zsolt Wagner
Given a poset we say a family is centered if it is obtained by `taking sets as close to the middle layer as possible'. A poset is said to have the…
math.CO2015
The typical structure of maximal triangle-free graphs
József Balogh, Hong Liu, Šárka Petříčková +1
Recently, settling a question of Erdős, Balogh and Petříčková showed that there are at most -vertex maximal triangle-free graphs, matching the previously know…
math.CO2013★ 8 cited
A note on list-coloring powers of graphs
Nicholas Kosar, Sarka Petrickova, Benjamin Reiniger +1
Recently, Kim and Park have found an infinite family of graphs whose squares are not chromatic-choosable. Xuding Zhu asked whether there is some such that all th power graph…