Jan Volec

According to our database1, Jan Volec authored at least 18 papers between 2011 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
A bound on the inducibility of cycles.
J. Comb. Theory, Ser. A, 2019

Minimum number of edges that occur in odd cycles.
J. Comb. Theory, Ser. B, 2019

No additional tournaments are quasirandom-forcing.
CoRR, 2019

2017
Rainbow triangles in three-colored graphs.
J. Comb. Theory, Ser. B, 2017

The codegree threshold of K<sub>4</sub><sup>-</sup>.
Electron. Notes Discret. Math., 2017

Bounded colorings of multipartite graphs and hypergraphs.
Eur. J. Comb., 2017

2015
Properly colored and rainbow copies of graphs with few cherries.
Electron. Notes Discret. Math., 2015

Minimum Number of Monotone Subsequences of Length 4 in Permutations.
Comb. Probab. Comput., 2015

Fractional Coloring of Triangle-Free Planar Graphs.
Electron. J. Comb., 2015

Limits of Order Types.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Subcubic triangle-free graphs have fractional chromatic number at most 14/5.
J. Lond. Math. Soc., 2014

Extensions of Fractional Precolorings Show Discontinuous Behavior.
J. Graph Theory, 2014

2013
An application of flag algebras to a problem of Erdős and Sós.
Electron. Notes Discret. Math., 2013

2012
Extending Fractional Precolorings.
SIAM J. Discret. Math., 2012

Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs.
Random Struct. Algorithms, 2012

Domination number of cubic graphs with large girth.
J. Graph Theory, 2012

2011
Fractional colorings of cubic graphs with large girth.
SIAM J. Discret. Math., 2011

On the Complexity of Planar Covering of Small Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011


  Loading...