### Submitted papers and preprints

- Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec:
*On tripartite common graphs*, submitted. arxiv:2012.02057. - R. Hancock, D. Kráľ, M. Krnc, J. Volec:
*Towards characterizing locally common graphs*, submitted. arXiv:2011.02562. - A. Grzesik, D. Kráľ, L. M. Lovász, J. Volec:
*Cycles of a given length in tournaments*, submitted. arXiv:2008.06577. - R. Hancock, A. Kabela, D. Kráľ, T. Martins, R. Parente, F. Skerman, J. Volec:
*No additional tournaments are quasirandom-forcing*, submitted. arXiv:1912.04243. - X. Goaoc, A. Hubard, R. de Joannis de Verclos, J.-S. Sereni, J. Volec:
*Limits of Order Types*, submitted. arXiv:1811.02236.

### Accepted papers

- D. Kráľ, J. A. Noel, S. Norin, J. Volec, F. Wei:
*Non-bipartite k-common graphs*, to appear in Combinatorica. Also available as arXiv:2006.09422. - A. Blumenthal, B. Lidický, O. Pikhurko, Y. Pehova, F. Pfender, J. Volec:
*Sharp bounds for decomposing graphs into edges and tringles*, to appear in Combinatorics, Probability and Computing. Also available as arXiv:1909.11371. - A. Blumenthal, B. Lidický, R. Martin, S. Norin, F. Pfender, J. Volec:
*Counterexamples to a conjecture of Harris on Hall ratio*, to appear in SIAM Journal on Discrete Mathematics. Also available as arXiv:1811.11116.

### Journal publications

- T. Chan, D. Kráľ, J. A. Noel, Y. Pehova, M. Sharifzadeh, J. Volec:
*Characterization of quasirandom permutations by a pattern sum*, Random Structures and Algorithms**57**(2020), 920-939. Also available as arXiv:1909.11027. - R. Glebov, D. Kráľ, J. Volec:
*Compactness and finite forcibility of graphons*, Journal of the European Mathematical Society**21**(2019), 3199-3223. Also available as arXiv:1309.6695. - A. Grzesik, P. Hu, J. Volec:
*Minimum number of edges that occur in odd cycles*, Journal of Combinatorial Theory, Series B**137**(2019), 65-103. Also available as arXiv:1605.09055. The files needed for a verification of the proofs of Claims A.1 and B.1 are here. - D. Kráľ, S. Norin, J. Volec:
*A bound on the inducibility of cycles*, Journal of Combinatorial Theory, Series A**161**(2019), 359-363. Also available as arXiv:1801.01556. - J. Balogh, P. Hu, B. Lidický, F. Pfender, J. Volec, M. Young:
*Rainbow triangles in three-colored graphs*, Journal of Combinatorial Theory, Series B**126**(2017), 83-113. Also available as arXiv:1408.5296. - B. Sudakov, N. Kamčev, J. Volec:
*Bounded colorings of multipartite graphs and hypergraphs*, European Journal of Combinatorics**66**(2017), 235-249. Also available as arXiv:1601.02271. - B. Sudakov, J. Volec:
*Properly colored and rainbow copies of graphs with few cherries*, Journal of Combinatorial Theory, Series B**122**(2017), 391-416. Also available as arXiv:1504.06176. - J.-S. Sereni, J. Volec:
*A note on acyclic vertex-colorings*, Journal of Combinatorics**7**(2016), 725-737. Also available as arXiv:1312.5600. - R. Glebov, D. Kráľ, J. Volec:
*A problem of Erdos and Sos on 3-graphs*, Israel Journal of Mathematics**211**(2016), 349-366. Also available as arXiv:1303.7372. The files needed for a verification of the proof of Lemma 5 are here. - Z. Dvořák, J.-S. Sereni, J. Volec:
*Fractional coloring of triangle-free planar graphs*, The Electronic Journal of Combinatorics**22**(2015), #P4.11. Also available as arXiv:1402.5331. - J. Balogh, P. Hu, B. Lidický, O. Pikhurko, B. Udvari, J. Volec:
*Minimum number of monotone subsequences of length 4 in permutations*, Combinatorics, Probability and Computing**24**(2015), 658-679. Also available as arXiv:1411.3024. - J. van den Heuvel, D. Kráľ, M. Kupec, J.-S. Sereni, J. Volec:
*Extensions of Fractional Precolorings show Discontinuous Behavior*, Journal of Graph Theory**77**(2014), 299-329. Also available as arXiv:1205.5405. - Z. Dvořák, J.-S. Sereni, J. Volec:
*Subcubic triangle-free graphs have fractional chromatic number at most 14/5*, Journal of the London Mathematical Society**89**(2014), 641-662. Also available as arXiv:1301.5296. - F. Kardoš, D. Kráľ, J. Volec:
*Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs*, Random Structures and Algorithms**41**(2012), 506-520. Also available as arXiv:1010.3415. The auxiliary files related to this paper are here. - D. Kráľ, M. Krnc, M. Kupec, B. Lužar, J. Volec:
*Extending fractional precolorings*, SIAM Journal on Discrete Mathematics**26**(2012), 647-660. - D. Kráľ, P. Škoda, J. Volec:
*Domination number of cubic graphs with large girth*, Journal of Graph Theory**69**(2012), 131-142. Also available as arXiv:0907.1166. - F. Kardoš, D. Kráľ, J. Volec:
*Fractional colorings of cubic graphs with large girth*, SIAM Journal on Discrete Mathematics**25**(2011), 1454-1476. Also available as arXiv:1010.3415.

### Contributions at conferences with published proceedings

- A. Blumenthal, B. Lidický, O. Pikhurko, Y. Pehova, F. Pfender, J. Volec:
*Sharp bounds for decomposing graphs into edges and tringles*, Acta Mathematica Universitatis Comenianae 88 (2019), 463-468. - R. Glebov, A. Grzesik, J. Volec:
*Degree conditions forcing oriented cycles*, Acta Mathematica Universitatis Comenianae 88 (2019), 729-733. - V. Falgas-Ravry, O. Pikhurko, E. Vaughan, J. Volec:
*The codegree threshold of K4-*, Electronic Notes in Discrete Mathematics 61C (2017), 407-413. - X. Goaoc, A. Hubard, R. de Joannis de Verclos, J.-S. Sereni, J. Volec:
*Limits of order types*, 31st International Symposium on Computational Geometry (SoCG 2015), Leibniz International Proceedings in Informatics (2015), 300-314. - B. Sudakov, J. Volec:
*Properly colored and rainbow copies of graphs with few cherries*, Electronic Notes in Discrete Mathematics 49 (2015), 315-321. - R. Glebov, D. Kráľ, J. Volec:
*An application of flag algebras to a problem of Erdös and Sós*, Electronic Notes in Discrete Mathematics 43 (2013), 171-177. - Z. Dvořák, J.-S. Sereni, J. Volec:
*Subcubic triangle-free graphs have fractional chromatic number at most 14/5*, CRM Series 16 (2013), 497-502. - R. Glebov, D. Kráľ, J. Volec:
*A problem of Erdös and Sós on 3-graphs*, CRM Series 16 (2013), 3-8. - O. Bílka, J. Jirásek, P. Klavík, M. Tancer, J. Volec:
*On the Complexity of Planar Covering of Small Graphs*, 37th Workshop on Graph-Theoretic Concepts in Computer Science 2011 (WG'11), Lecture Notes in Computer Science vol. 6986, pp. 83–94, Springer-Verlag, 2011. Also available as arXiv:1108.0064.