Number of items: 6.
Grzesik, Andrzej, Hu, Ping and Volec, Jan
(2019)
Minimum number of edges that occur in odd cycles.
Journal of Combinatorial Theory, Series B, 137
.
pp. 65-103.
doi:10.1016/j.jctb.2018.12.003
ISSN 00958956.
Hladký, Jan, Hu, Ping and Piguet, Diana
(2019)
Komlós's tiling theorem via graphon covers.
Journal of Graph Theory, 90
(1).
pp. 24-45.
doi:10.1002/jgt.22365
ISSN 0364-9024.
Hladký, Jan, Hu, Ping and Piguet, Diana
(2019)
Komlós’s tiling theorem via graphon covers.
Journal of Graph Theory, 90
(1).
pp. 24-45.
doi:10.1002/jgt.22365
ISSN 1097-0118.
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, 126
.
pp. 83-113.
doi:10.1016/j.jctb.2017.04.002
ISSN 0095-8956.
Dolezal, Martin, Hladký, Jan, Hu, Ping and Piguet, Diana
(2017)
First steps in combinatorial optimization on graphons : matchings.
Electronic Notes in Discrete Mathematics, 61
.
pp. 359-365.
doi:10.1016/j.endm.2017.06.060
ISSN 1571-0653.
Balogh, József, Hu, Ping, Lidicky, Bernard, Pikhurko, Oleg, Udvari, Balázs and Volec, Jan
(2015)
Minimum number of monotone subsequences of length 4 in permutations.
Combinatorics, Probability and Computing, 24
(4).
pp. 658-679.
doi:10.1017/S0963548314000820
ISSN 0963-5483.
This list was generated on Fri Apr 19 05:17:41 2024 BST.