JVJan Volec

Jan Volec

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jan Volec has a total of 85 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Sidorenko property and forcing in regular tournaments

    by Daniel Král', Matjaž Krnc, Filip Kučerák, Bernard Lidický, Jan Volec

    We give a complete characterization of tournaments H that have the Sidorenko property with respect to nearly regular tournaments, i.e., the homomorphism density of H among all nearly regular tournaments is minimized by a random tournament. Corollaries of our result are a positive answer to the question of Noel, Ranganathan and Simbaqueba whether there exist infinitely many non-transitive tournaments that are quasirandom forcing for nearly regular tournaments, and a negative answer to their question whether almost every tournament is quasirandom forcing for nearly regular tournaments.

  • Open Access

    Semi-Inducibility of some small graphs

    by József Balogh, Bernard Lidický, Dhruv Mubayi, Florian Pfender, Jan Volec

    Let $H$ be a fixed graph whose edges are colored red and blue and let $β\in [0,1]$. Let $I(H, β)$ be the (asymptotically normalized) maximum number of copies of $H$ in a large red/blue edge-colored complete graph $G$, where the density of red edges in $G$ is $β$. This refines the problem of determining the semi-inducibility of $H$, which is itself a generalization of the classical question of determining the inducibility of $H$. The function $I(H, β)$ for $β\in [0,1]$ was not known for any graph $H$ on more than three vertices, except when $H$ is a monochromatic clique (Kruskal-Katona) or a monochromatic star (Reiher-Wagner). We obtain sharp results for some four and five vertex graphs, addressing several recent questions posed by various authors. We also obtain some general results for trees and stars. Many open problems remain.

  • Common graphs with arbitrary chromatic number

    by Daniel Král͏̌, Jan Volec, Fan Wei

    Ramsey’s theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H . In 1962, Erdős conjectured that the random 2-edge-coloring minimizes the number of monochromatic copies of $K_k$ , and the conjecture was extended by Burr and Rosta to all graphs. In the late 1980s, the conjectures were disproved by Thomason and Sidorenko, respectively. A classification of graphs whose number of monochromatic copies is minimized by the random 2-edge-coloring, which are referred to as common graphs, remains a challenging open problem. If Sidorenko’s conjecture, one of the most significant open problems in extremal graph theory, is true, then every 2-chromatic graph is common and, in fact, no 2-chromatic common graph unsettled for Sidorenko’s conjecture is known. While examples of 3-chromatic common graphs were known for a long time, the existence of a 4-chromatic common graph was open until 2012, and no common graph with a larger chromatic number is known. We construct connected k -chromatic common graphs for every k . This answers a question posed by Hatami et al. [ Non-three-colourable common graphs exist , Combin. Probab. Comput. 21 (2012), 734–742], and a problem listed by Conlon et al. [ Recent developments in graph Ramsey theory , in Surveys in combinatorics 2015 , London Mathematical Society Lecture Note Series, vol. 424 (Cambridge University Press, Cambridge, 2015), 49–118, Problem 2.28]. This also answers in a stronger form the question raised by Jagger et al. [ Multiplicities of subgraphs , Combinatorica 16 (1996), 123–131] whether there exists a common graph with chromatic number at least four.


  • Open Access

    Common graphs with arbitrary chromatic number

    by Daniel Kral, Jan Volec, Fan Wei

    Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. In 1962, Erdos conjectured that the random 2-edge-coloring minimizes the number of monochromatic copies of K_k, and the conjecture was extended by Burr and Rosta to all graphs. In the late 1980s, the conjectures were disproved by Thomason and Sidorenko, respectively. A classification of graphs whose number of monochromatic copies is minimized by the random 2-edge-coloring, which are referred to as common graphs, remains a challenging open problem. If Sidorenko's Conjecture, one of the most significant open problems in extremal graph theory, is true, then every 2-chromatic graph is common, and in fact, no 2-chromatic common graph unsettled for Sidorenko's Conjecture is known. While examples of 3-chromatic common graphs were known for a long time, the existence of a 4-chromatic common graph was open until 2012, and no common graph with a larger chromatic number is known. We construct connected k-chromatic common graphs for every k. This answers a question posed by Hatami, Hladky, Kral, Norine and Razborov [Combin. Probab. Comput. 21 (2012), 734-742], and a problem listed by Conlon, Fox and Sudakov [London Math. Soc. Lecture Note Ser. 424 (2015), 49-118, Problem 2.28]. This also answers in a stronger form the question raised by Jagger, Stovicek and Thomason [Combinatorica 16, (1996), 123-131] whether there exists a common graph with chromatic number at least four.

  • Open Access

    Degree conditions forcing directed cycles

    by Andrzej Grzesik, Jan Volec

    Caccetta-H\"{a}ggkvist conjecture is a longstanding open problem on degree conditions that force an oriented graph to contain a directed cycle of a bounded length. Motivated by this conjecture, Kelly, K\"uhn, and Osthus initiated a study of degree conditions forcing the containment of a directed cycle of a given length. In particular, they found the optimal minimum semidegree, that is, the smaller of the minimum indegree and the minimum outdegree, which forces a large oriented graph to contain a directed cycle of a given length not divisible by 3, and conjectured the optimal minimum semidegree for all the other cycles except the directed triangle. In this paper, we establish the best possible minimum semidegree that forces a large oriented graph to contain a directed cycle of a given length divisible by 3 yet not equal to 3, hence fully resolve the conjecture by Kelly, K\"{u}hn, and Osthus. We also find an asymptotically optimal semidegree threshold of any cycle with a given orientation of its edges with the sole exception of a directed triangle.

  • Open Access

    The Spectrum of Triangle-free Graphs

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

    Denote by $q_n(G)$ the smallest eigenvalue of the signless Laplacian matrix of an $n$-vertex graph $G$. Brandt conjectured in 1997 that for regular triangle-free graphs $q_n(G) \leq \frac{4n}{25}$. We prove a stronger result: If $G$ is a triangle-free graph then $q_n(G) \leq \frac{15n}{94}< \frac{4n}{25}$. Brandt's conjecture is a subproblem of two famous conjectures of Erd\H{o}s: (1) Sparse-Half-Conjecture: Every $n$-vertex triangle-free graph has a subset of vertices of size $\lceil\frac{n}{2}\rceil$ spanning at most $n^2/50$ edges. (2) Every $n$-vertex triangle-free graph can be made bipartite by removing at most $n^2/25$ edges. In our proof we use linear algebraic methods to upper bound $q_n(G)$ by the ratio between the number of induced paths with 3 and 4 vertices. We give an upper bound on this ratio via the method of flag algebras.

  • Open Access

    The codegree threshold of $K_4^-$

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

    The codegree threshold $\mathrm{ex}_2(n, F)$ of a $3$-graph $F$ is the minimum $d=d(n)$ such that every $3$-graph on $n$ vertices in which every pair of vertices is contained in at least $d+1$ edges contains a copy of $F$ as a subgraph. We study $\mathrm{ex}_2(n, F)$ when $F=K_4^-$, the $3$-graph on $4$ vertices with $3$ edges. Using flag algebra techniques, we prove that if $n$ is sufficiently large then $\mathrm{ex}_2(n, K_4^-)\leq (n+1)/4$. This settles in the affirmative a conjecture of Nagle from 1999. In addition, we obtain a stability result: for every near-extremal configuration $G$, there is a quasirandom tournament $T$ on the same vertex set such that $G$ is close in the edit distance to the $3$-graph $C(T)$ whose edges are the cyclically oriented triangles from $T$. For infinitely many values of $n$, we are further able to determine $\mathrm{ex}_2(n, K_4^-)$ exactly and to show that tournament-based constructions $C(T)$ are extremal for those values of $n$.

  • Open Access

    No additional tournaments are quasirandom-forcing

    by Robert Hancock, Adam Kabela, Daniel Kral, Taisa Martins, Roberto Parente, Fiona Skerman, Jan Volec

    A tournament H is quasirandom-forcing if the following holds for every sequence (G_n) of tournaments of growing orders: if the density of H in G_n converges to the expected density of H in a random tournament, then (G_n) is quasirandom. Every transitive tournament with at least 4 vertices is quasirandom-forcing, and Coregliano et al. [Electron. J. Combin. 26 (2019), P1.44] showed that there is also a non-transitive 5-vertex tournament with the property. We show that no additional tournament has this property. This extends the result of Bucic et al. [Combinatorica 41 (2021), 175-208] that the non-transitive tournaments with seven or more vertices do not have this property.

  • Open Access

    Cycles of a given length in tournaments

    by Andrzej Grzesik, Daniel Kral, Laszlo Miklos Lovasz, Jan Volec

    We study the asymptotic behavior of the maximum number of directed cycles of a given length in a tournament: let $c(\ell)$ be the limit of the ratio of the maximum number of cycles of length $\ell$ in an $n$-vertex tournament and the expected number of cycles of length $\ell$ in the random $n$-vertex tournament, when $n$ tends to infinity. It is well-known that $c(3)=1$ and $c(4)=4/3$. We show that $c(\ell)=1$ if and only if $\ell$ is not divisible by four, which settles a conjecture of Bartley and Day. If $\ell$ is divisible by four, we show that $1+2\cdot\left(2/\pi\right)^{\ell}\le c(\ell)\le 1+\left(2/\pi+o(1)\right)^{\ell}$ and determine the value $c(\ell)$ exactly for $\ell = 8$. We also give a full description of the asymptotic structure of tournaments with the maximum number of cycles of length $\ell$ when $\ell$ is not divisible by four or $\ell\in\{4,8\}$.

  • Open Access

    Characterization of quasirandom permutations by a pattern sum

    by Timothy F. N. Chan, Daniel Kral, Jonathan A. Noel, Yanitsa Pehova, Maryam Sharifzadeh, Jan Volec

    It is known that a sequence Pi_i of permutations is quasirandom if and only if the pattern density of every 4-point permutation in Pi_i converges to 1/24. We show that there is a set S of 4-point permutations such that the sum of the pattern densities of the permutations from S in the permutations Pi_i converges to |S|/24 if and only if the sequence is quasirandom. Moreover, we are able to completely characterize the sets S with this property. In particular, there are exactly ten such sets, the smallest of which has cardinality eight.