Sharp bounds for decomposing graphs into edges and triangles
(opens in new window)
Author(s):
Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec
Published in:
Combinatorics, Probability and Computing, Issue 30/2, 2021, Page(s) 271-287, ISSN 0963-5483
Publisher:
Cambridge University Press
DOI:
10.1017/s0963548320000358
On tripartite common graphs
(opens in new window)
Author(s):
Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec
Published in:
Combinatorics, Probability and Computing, Issue 31, 2022, Page(s) 907-923, ISSN 0963-5483
Publisher:
Cambridge University Press
DOI:
10.1017/s0963548322000074
Compactness and finite forcibility of graphons
(opens in new window)
Author(s):
Roman Glebov, Daniel Král', Jan Volec
Published in:
Journal of the European Mathematical Society, Issue 21/10, 2019, Page(s) 3199-3223, ISSN 1435-9855
Publisher:
European Mathematical Society Publishing House
DOI:
10.4171/jems/901
Counterexamples to a Conjecture of Harris on Hall Ratio
(opens in new window)
Author(s):
Adam Blumenthal; Bernard Lidický; Ryan R. Martin; Sergey Norin; Florian Pfender; Jan Volec
Published in:
SIAM Journal on Discrete Mathematics, Issue 36, 2022, ISSN 0895-4801
Publisher:
Society for Industrial and Applied Mathematics
DOI:
10.1137/18m1229420