Følg
Jan Volec
Jan Volec
Czech Technical University in Prague, Faculty of Nuclear Sciences and Physical Engineering
Verifisert e-postadresse på ucw.cz - Startside
Tittel
Sitert av
Sitert av
År
A problem of Erdős and Sós on 3-graphs
R Glebov, D Kráľ, J Volec
Israel Journal of Mathematics 211 (1), 349-366, 2016
522016
Minimum number of monotone subsequences of length 4 in permutations
J Balogh, P Hu, B Lidický, O Pikhurko, B Udvari, J Volec
Combinatorics, Probability and Computing 24 (4), 658-679, 2015
412015
Rainbow triangles in three-colored graphs
J Balogh, P Hu, B Lidický, F Pfender, J Volec, M Young
Journal of Combinatorial Theory, Series B 126, 83-113, 2017
332017
Characterization of quasirandom permutations by a pattern sum
TFN Chan, D Král', JA Noel, Y Pehova, M Sharifzadeh, J Volec
Random Structures & Algorithms, 2020
232020
A bound on the inducibility of cycles
D Kráľ, S Norin, J Volec
Journal of Combinatorial Theory, Series A 161, 359-363, 2019
23*2019
Subcubic triangle-free graphs have fractional chromatic number at most 14/5
Z Dvořák, JS Sereni, J Volec
Journal of the London Mathematical Society 89 (3), 641-662, 2014
222014
A note on acyclic vertex-colorings
JS Sereni, J Volec
Journal of Combinatorics 7 (4), 725-737, 2016
192016
Fractional colorings of cubic graphs with large girth
F Kardoš, D Král’, J Volec
SIAM Journal on Discrete Mathematics 25 (3), 1454-1476, 2011
192011
On tripartite common graphs
A Grzesik, J Lee, B Lidický, J Volec
Combinatorics, Probability and Computing 31 (5), 907-923, 2022
182022
Limits of order types
X Goaoc, A Hubard, RJ de Verclos, JS Sereni, J Volec
arXiv preprint arXiv:1811.02236, 2018
182018
Properly colored and rainbow copies of graphs with few cherries
B Sudakov, J Volec
Journal of Combinatorial Theory, Series B 122, 391-416, 2017
182017
Maximum edge‐cuts in cubic graphs with large girth and in random cubic graphs
F Kardoš, D Král′, J Volec
Random Structures & Algorithms 41 (4), 506-520, 2012
182012
Domination number of cubic graphs with large girth
D Král', P Škoda, J Volec
Journal of Graph Theory 69 (2), 131-142, 2012
162012
Fractional coloring of triangle-free planar graphs
Z Dvořák, JS Sereni, J Volec
The Electronic Journal of Combinatorics 22 (4), #P4.11, 2015
152015
The codegree threshold of K_4-
V Falgas‐Ravry, O Pikhurko, E Vaughan, J Volec
Journal of the London Mathematical Society 107 (5), 1660-1691, 2023
14*2023
Non-bipartite k-common graphs
D Kral, JA Noel, S Norin, J Volec, F Wei
Combinatorica, 1-28, 2022
132022
Minimum number of edges that occur in odd cycles
A Grzesik, P Hu, J Volec
Journal of Combinatorial Theory, Series B 137, 65-103, 2019
132019
No additional tournaments are quasirandom-forcing
R Hancock, A Kabela, T Martins, R Parente, F Skerman, J Volec
European Journal of Combinatorics 108, 103632, 2023
102023
On the complexity of planar covering of small graphs
O Bílka, J Jirásek, P Klavík, M Tancer, J Volec
Graph-Theoretic Concepts in Computer Science: 37th International Workshop …, 2011
102011
The spectrum of triangle-free graphs
J Balogh, FC Clemen, B Lidický, S Norin, J Volec
SIAM Journal on Discrete Mathematics 37 (2), 1173-1179, 2023
92023
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20