Jan Volec

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 19

Top Topics

Structured Objects

Graph Theoretic

Top Venues

J. Comb. Theory, Ser. B

Comb. Probab. Comput.

Publications

Matej Trödler, Jan Volec, Jan Vybíral
A tight lower bound on the minimal dispersion. Eur. J. Comb. 120 (2024)
Robert Hancock, Daniel Král', Matjaz Krnc, Jan Volec
Toward characterizing locally common graphs. Random Struct. Algorithms 62 (1) (2023)
Matej Trödler, Jan Volec, Jan Vybíral
A tight lower bound on the minimal dispersion. CoRR (2023)
Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec
No additional tournaments are quasirandom-forcing. Eur. J. Comb. 108 (2023)
József Balogh, Felix Christian Clemen, Bernard Lidický, Sergey Norin, Jan Volec
The Spectrum of Triangle-Free Graphs. SIAM J. Discret. Math. 37 (2) (2023)
Andrzej Grzesik, Daniel Král', László Miklós Lovász, Jan Volec
Cycles of a given length in tournaments. J. Comb. Theory, Ser. B 158 (Part) (2023)
Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, Jan Volec
Counterexamples to a Conjecture of Harris on Hall Ratio. SIAM J. Discret. Math. 36 (3) (2022)
Daniel Král', Jonathan A. Noel, Sergey Norin, Jan Volec, Fan Wei
Non-Bipartite K-Common Graphs. Comb. 42 (1) (2022)
Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec
On tripartite common graphs. Comb. Probab. Comput. 31 (5) (2022)
Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec
Sharp bounds for decomposing graphs into edges and triangles. Comb. Probab. Comput. 30 (2) (2021)
Timothy F. N. Chan, Daniel Král', Jonathan A. Noel, Yanitsa Pehova, Maryam Sharifzadeh, Jan Volec
Characterization of quasirandom permutations by a pattern sum. Random Struct. Algorithms 57 (4) (2020)
Robert Hancock, Adam Kabela, Daniel Král, Taísa L. Martins, Roberto Parente, Fiona Skerman, Jan Volec
No additional tournaments are quasirandom-forcing. CoRR (2019)
Andrzej Grzesik, Ping Hu, Jan Volec
Minimum number of edges that occur in odd cycles. J. Comb. Theory, Ser. B 137 (2019)
Daniel Král', Sergey Norin, Jan Volec
A bound on the inducibility of cycles. J. Comb. Theory, Ser. A 161 (2019)
József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young
Rainbow triangles in three-colored graphs. J. Comb. Theory, Ser. B 126 (2017)
Nina Kamcev, Benny Sudakov, Jan Volec
Bounded colorings of multipartite graphs and hypergraphs. Eur. J. Comb. 66 (2017)
Benny Sudakov, Jan Volec
Properly colored and rainbow copies of graphs with few cherries. J. Comb. Theory, Ser. B 122 (2017)
Victor Falgas-Ravry, Oleg Pikhurko, Emil R. Vaughan, Jan Volec
. Electron. Notes Discret. Math. 61 (2017)
Andrzej Grzesik, Ping Hu, Jan Volec
Minimum number of edges that occur in odd cycles. CoRR (2016)
József Balogh, Ping Hu, Bernard Lidický, Oleg Pikhurko, Balázs Udvari, Jan Volec
Minimum Number of Monotone Subsequences of Length 4 in Permutations. Comb. Probab. Comput. 24 (4) (2015)
Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec
Fractional Coloring of Triangle-Free Planar Graphs. Electron. J. Comb. 22 (4) (2015)
Benny Sudakov, Jan Volec
Properly colored and rainbow copies of graphs with few cherries. Electron. Notes Discret. Math. 49 (2015)
Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos, Jean-Sébastien Sereni, Jan Volec
Limits of Order Types. SoCG (2015)
Jan van den Heuvel, Daniel Král, Martin Kupec, Jean-Sébastien Sereni, Jan Volec
Extensions of Fractional Precolorings Show Discontinuous Behavior. J. Graph Theory 77 (4) (2014)
Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec
Subcubic triangle-free graphs have fractional chromatic number at most 14/5. J. Lond. Math. Soc. 89 (3) (2014)
Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec
Subcubic triangle-free graphs have fractional chromatic number at most 14/5 CoRR (2013)
Roman Glebov, Daniel Král', Jan Volec
An application of flag algebras to a problem of Erdős and Sós. Electron. Notes Discret. Math. 43 (2013)
Daniel Král', Petr Skoda, Jan Volec
Domination number of cubic graphs with large girth. J. Graph Theory 69 (2) (2012)
Daniel Král', Matjaz Krnc, Martin Kupec, Borut Luzar, Jan Volec
Extending Fractional Precolorings. SIAM J. Discret. Math. 26 (2) (2012)
Frantisek Kardos, Daniel Král', Jan Volec
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs. Random Struct. Algorithms 41 (4) (2012)
Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec
On the Complexity of Planar Covering of Small Graphs. WG (2011)
Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec
On the Complexity of Planar Covering of Small Graphs CoRR (2011)
Frantisek Kardos, Daniel Král', Jan Volec
Fractional colorings of cubic graphs with large girth. SIAM J. Discret. Math. 25 (3) (2011)