Jan Volec

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