JV
Jan Volec
math.COcs.DMcs.NAmath.NA
On Valency
published · living versionsW_kjmy2rxs·v1 · currentpublished
W_3qer5dmp·v1published
Preprints & journals
39 papers in the corpus · 2009–2026Maximizing in graphs with fixed edge density2609.08194v1 · J'ozsef Balogh, Andrzej Grzesik, Bernard Lidick'y et al.2026 · 0 citationsarXiv
Strong edge-colouring via local flag algebras2607.17421v1 · Eoin Davey, Eoin Hurley, R'emi de Joannis de Verclos et al.2026 · 0 citationsarXiv
Local flag algebras2607.12461v1 · Eoin Davey, Eoin Hurley, R'emi de Joannis de Verclos et al.2026 · 0 citationsarXiv
Sidorenko property and forcing in regular tournaments2602.12551v2 · Daniel Kr'al', Matjaz Krnc, Filip Kucer'ak et al.2026 · 0 citationsarXiv
Semi-Inducibility of some small graphs2601.03433v1 · J'ozsef Balogh, Bernard Lidick'y, Dhruv Mubayi et al.2026 · 0 citationsarXiv
Lower bounds on the minimal dispersion of point sets via cover-free families2504.00715v2 · Matej Trodler, Jan Volec, Jan Vyb'iral2025 · 0 citationsJournal of Complexity, Volume 91, December 2025, 101974
Subgraphs with a positive minimum semidegree in digraphs with large outdegree2408.06015v2 · Andrzej Grzesik, Vojtech Rodl, Jan Volec2024 · 0 citationsInnovations in Graph Theory, Volume 2 (2025), pp. 301-312
Tight Hamiltonicity from dense links of triples2403.14518v2 · Richard Lang, Mathias Schacht, Jan Volec2024 · 0 citationsarXiv
A tight lower bound on the minimal dispersion2311.10666v3 · Matej Trodler, Jan Volec, Jan Vyb'iral2023 · 3 citationsEuropean Journal of Combinatorics, 2024
Common graphs with arbitrary chromatic number2206.05800v5 · Daniel Kral, Jan Volec, Fan Wei2022 · 4 citationsarXiv
The Spectrum of Triangle-free Graphs2204.00093v4 · J'ozsef Balogh, Felix Christian Clemen, Bernard Lidick'y et al.2022 · 3 citationsarXiv
The codegree threshold of 2112.09396v4 · Victor Falgas-Ravry, Oleg Pikhurko, Emil R. Vaughan et al.2021 · 8 citationsarXiv
Degree conditions forcing directed cycles2102.12830v2 · Andrzej Grzesik, Jan Volec2021 · 0 citationsarXiv
On tripartite common graphs2012.02057v2 · Andrzej Grzesik, Joonkyung Lee, Bernard Lidick'y et al.2020 · 12 citationsarXiv
Towards characterizing locally common graphs2011.02562v2 · Robert Hancock, Daniel Kral, Matjaz Krnc et al.2020 · 1 citationarXiv
Cycles of a given length in tournaments2008.06577v3 · Andrzej Grzesik, Daniel Kral, Laszlo Miklos Lovasz et al.2020 · 9 citationsarXiv
Non-bipartite k-common graphs2006.09422v7 · Daniel Kral, Jonathan A. Noel, Sergey Norin et al.2020 · 9 citationsCombinatorica 42 (2022) 87-114
No additional tournaments are quasirandom-forcing1912.04243v3 · Robert Hancock, Adam Kabela, Daniel Kral et al.2019 · 10 citationsarXiv
Sharp bounds for decomposing graphs into edges and triangles1909.11371v3 · Adam Blumenthal, Bernard Lidick'y, Yanitsa Pehova et al.2019 · 3 citationsCombinator. Probab. Comp. 30 (2021) 271-287
Characterization of quasirandom permutations by a pattern sum1909.11027v7 · Timothy F. N. Chan, Daniel Kral, Jonathan A. Noel et al.2019 · 19 citationsarXiv
Counterexamples to a conjecture of Harris on Hall ratio1811.11116v4 · Adam Blumenthal, Bernard Lidicky, Ryan R. Martin et al.2018 · 4 citationsarXiv
Limits of Order Types1811.02236v1 · Xavier Goaoc, Alfredo Hubard, R'emi de Joannis de Verclos et al.2018 · 0 citationsarXiv
A bound on the inducibility of cycles1801.01556v2 · Daniel Kral, Sergey Norin, Jan Volec2018 · 21 citationsJ. Combin. Theory Ser. A 161 (2019), 359-363
Densities of 3-vertex graphs1610.02446v3 · Roman Glebov, Andrzej Grzesik, Ping Hu et al.2016 · 2 citationsarXiv
Minimum number of edges that occur in odd cycles1605.09055v3 · Andrzej Grzesik, Ping Hu, Jan Volec2016 · 9 citationsarXiv
Bounded colorings of multipartite graphs and hypergraphs1601.02271v2 · Nina Kamcev, Benny Sudakov, Jan Volec2016 · 6 citationsarXiv
Properly colored and rainbow copies of graphs with few cherries1504.06176v3 · Benny Sudakov, Jan Volec2015 · 16 citationsarXiv
Minimum number of monotone subsequences of length 4 in permutations1411.3024v1 · J'ozsef Balogh, Ping Hu, Bernard Lidick'y et al.2014 · 34 citationsCombinator. Probab. Comp. 24 (2014) 658-679
Rainbow triangles in three-colored graphs1408.5296v1 · Jozsef Balogh, Ping Hu, Bernard Lidicky et al.2014 · 32 citationsarXiv
Fractional coloring of triangle-free planar graphs1402.5331v1 · Zdenek Dvor'ak, Jean-S'ebastien Sereni, Jan Volec2014 · 12 citationsarXiv
A note on acyclic vertex-colorings1312.5600v1 · Jean-S'ebastien Sereni, Jan Volec2013 · 12 citationsarXiv
Compactness and finite forcibility of graphons1309.6695v7 · Roman Glebov, Daniel Kral, Jan Volec2013 · 10 citationsarXiv
A problem of Erdos and Sos on 3-graphs1303.7372v2 · Roman Glebov, Daniel Kral, Jan Volec2013 · 43 citationsarXiv
Subcubic triangle-free graphs have fractional chromatic number at most 14/51301.5296v3 · Zdenek Dvor'ak, Jean-S'ebastien Sereni, Jan Volec (DIMAP)2013 · 14 citationsarXiv
Extensions of Fractional Precolorings show Discontinuous Behavior1205.5405v2 · Jan van den Heuvel, Daniel Kral, Martin Kupec et al.2012 · 0 citationsarXiv
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs1108.6280v4 · Frantisek Kardos, Daniel Kral, Jan Volec2011 · 12 citationsarXiv
On the Complexity of Planar Covering of Small Graphs1108.0064v1 · Ondrej B'ilka, Jozef Jir'asek, Pavel Klav'ik et al.2011 · 11 citationsarXiv
Fractional colorings of cubic graphs with large girth1010.3415v1 · Frantisek Kardos, Daniel Kral, Jan Volec2010 · 13 citationsarXiv
Domination number of cubic graphs with large girth0907.1166v1 · Daniel Kral, Petr Skoda, Jan Volec2009 · 12 citationsarXiv
Career total: 64 works. 39 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.