The following pages link to Jan Volec (Q273101):
Displaying 37 items.
- A problem of Erdős and Sós on 3-graphs (Q273102) (← links)
- A note on acyclic vertex-colorings (Q344457) (← links)
- Fractional coloring of triangle-free planar graphs (Q888619) (← links)
- A bound on the inducibility of cycles (Q1621427) (← links)
- The codegree threshold of \(K_4^-\) (Q1689950) (← links)
- Cycles of a given length in tournaments (Q2099412) (← links)
- No additional tournaments are quasirandom-forcing (Q2107498) (← links)
- Non-bipartite \(k\)-common graphs (Q2151175) (← links)
- Minimum number of edges that occur in odd cycles (Q2312602) (← links)
- Compactness and finite forcibility of graphons (Q2327712) (← links)
- Bounded colorings of multipartite graphs and hypergraphs (Q2403698) (← links)
- Extending fractional precolorings (Q2910941) (← links)
- Extensions of Fractional Precolorings Show Discontinuous Behavior (Q2930044) (← links)
- Domination number of cubic graphs with large girth (Q3113283) (← links)
- Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (Q3145840) (← links)
- Fractional colorings of cubic graphs with large girth (Q3225133) (← links)
- Characterization of quasirandom permutations by a pattern sum (Q3386522) (← links)
- Sharp bounds for decomposing graphs into edges and triangles (Q4993262) (← links)
- Counterexamples to a Conjecture of Harris on Hall Ratio (Q5093587) (← links)
- Minimum Number of Monotone Subsequences of Length 4 in Permutations (Q5364246) (← links)
- Limits of Order Types (Q5368695) (← links)
- (Q5420012) (← links)
- Subcubic triangle-free graphs have fractional chromatic number at most 14/5 (Q5494396) (← links)
- On tripartite common graphs (Q5886347) (← links)
- Properly colored and rainbow copies of graphs with few cherries (Q5890911) (← links)
- Toward characterizing locally common graphs (Q6077054) (← links)
- Degree Conditions Forcing Directed Cycles (Q6097876) (← links)
- The Spectrum of Triangle-Free Graphs (Q6157996) (← links)
- Non-bipartite k-common graphs (Q6343067) (← links)
- Extensions of fractional precolorings show discontinuous behavior (Q6486791) (← links)
- Common graphs with arbitrary chromatic number (Q6506057) (← links)
- A tight lower bound on the minimal dispersion (Q6514393) (← links)
- Tight Hamiltonicity from dense links of triples (Q6527080) (← links)
- A tight lower bound on the minimal dispersion (Q6568828) (← links)
- Sharp bounds for decomposing graphs into edges and triangles (Q6621162) (← links)
- Degree conditions forcing oriented cycles (Q6621208) (← links)
- Subgraphs with a positive minimum semidegree in digraphs with large outdegree (Q6740112) (← links)
