Jan Volec

According to our database, Jan Volec authored at least 27 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A tight lower bound on the minimal dispersion.

Matej Trödler, Jan Volec, Jan Vybíral

Eur. J. Comb., 2024

2023

The Spectrum of Triangle-Free Graphs.

József Balogh, Felix Christian Clemen, Bernard Lidický, Sergey Norin, Jan Volec

SIAM J. Discret. Math., June, 2023

Toward characterizing locally common graphs.

Robert Hancock, Daniel Král', Matjaz Krnc, Jan Volec

Random Struct. Algorithms, 2023

Cycles of a given length in tournaments.

Andrzej Grzesik, Daniel Král', László Miklós Lovász, Jan Volec

J. Comb. Theory B, 2023

No additional tournaments are quasirandom-forcing.

Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec

Eur. J. Comb., 2023

2022

Counterexamples to a Conjecture of Harris on Hall Ratio.

Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, Jan Volec

SIAM J. Discret. Math., 2022

On tripartite common graphs.

Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec

Comb. Probab. Comput., 2022

Non-Bipartite K-Common Graphs.

Daniel Král', Jonathan A. Noel, Sergey Norin, Jan Volec, Fan Wei

Comb., 2022

2021

Sharp bounds for decomposing graphs into edges and triangles.

Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec

Comb. Probab. Comput., 2021

2020

Characterization of quasirandom permutations by a pattern sum.

Timothy F. N. Chan, Daniel Král', Jonathan A. Noel, Yanitsa Pehova, Maryam Sharifzadeh, Jan Volec

Random Struct. Algorithms, 2020

2019

A bound on the inducibility of cycles.

Daniel Král', Sergey Norin, Jan Volec

J. Comb. Theory A, 2019

Minimum number of edges that occur in odd cycles.

Andrzej Grzesik, Ping Hu, Jan Volec

J. Comb. Theory B, 2019

2017

Properly colored and rainbow copies of graphs with few cherries.

Benny Sudakov, Jan Volec

J. Comb. Theory B, 2017

Rainbow triangles in three-colored graphs.

József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young

J. Comb. Theory B, 2017

The codegree threshold of K₄^-.

Victor Falgas-Ravry, Oleg Pikhurko, Emil R. Vaughan, Jan Volec

Electron. Notes Discret. Math., 2017

Bounded colorings of multipartite graphs and hypergraphs.

Nina Kamcev, Benny Sudakov, Jan Volec

Eur. J. Comb., 2017

2015

Minimum Number of Monotone Subsequences of Length 4 in Permutations.

József Balogh, Ping Hu, Bernard Lidický, Oleg Pikhurko, Balázs Udvari, Jan Volec

Comb. Probab. Comput., 2015

Fractional Coloring of Triangle-Free Planar Graphs.

Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec

Electron. J. Comb., 2015

Limits of Order Types.

Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos, Jean-Sébastien Sereni, Jan Volec

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Subcubic triangle-free graphs have fractional chromatic number at most 14/5.

Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec

J. Lond. Math. Soc., 2014

Extensions of Fractional Precolorings Show Discontinuous Behavior.

Jan van den Heuvel, Daniel Král, Martin Kupec, Jean-Sébastien Sereni, Jan Volec

J. Graph Theory, 2014

2013

An application of flag algebras to a problem of Erdős and Sós.

Roman Glebov, Daniel Král', Jan Volec

Electron. Notes Discret. Math., 2013

2012

Extending Fractional Precolorings.

Daniel Král', Matjaz Krnc, Martin Kupec, Borut Luzar, Jan Volec

SIAM J. Discret. Math., 2012

Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs.

Frantisek Kardos, Daniel Král', Jan Volec

Random Struct. Algorithms, 2012

Domination number of cubic graphs with large girth.

Daniel Král', Petr Skoda, Jan Volec

J. Graph Theory, 2012

2011

Fractional colorings of cubic graphs with large girth.

Frantisek Kardos, Daniel Král', Jan Volec

SIAM J. Discret. Math., 2011

On the Complexity of Planar Covering of Small Graphs.

Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011