Jan Volec

From MaRDI portal
Person:273101

Available identifiers

zbMath Open volec.janDBLP51/10043WikidataQ59818585 ScholiaQ59818585MaRDI QIDQ273101

List of research outcomes





PublicationDate of PublicationType
Sharp bounds for decomposing graphs into edges and triangles2024-10-18Paper
Degree conditions forcing oriented cycles2024-10-18Paper
A tight lower bound on the minimal dispersion2024-07-08Paper
Toward characterizing locally common graphs2023-10-17Paper
The codegree threshold of \(K_4^-\)2023-08-23Paper
The Spectrum of Triangle-Free Graphs2023-06-22Paper
Degree Conditions Forcing Directed Cycles2023-06-07Paper
On tripartite common graphs2023-03-31Paper
No additional tournaments are quasirandom-forcing2022-12-01Paper
Cycles of a given length in tournaments2022-11-23Paper
Counterexamples to a Conjecture of Harris on Hall Ratio2022-07-28Paper
Non-bipartite \(k\)-common graphs2022-06-30Paper
Sharp bounds for decomposing graphs into edges and triangles2021-06-15Paper
Characterization of quasirandom permutations by a pattern sum2021-01-05Paper
Non-bipartite k-common graphs2020-06-16Paper
Compactness and finite forcibility of graphons2019-10-15Paper
Minimum number of edges that occur in odd cycles2019-07-17Paper
A bound on the inducibility of cycles2018-11-08Paper
The codegree threshold of \(K_4^-\)2018-01-18Paper
Limits of order types2017-10-10Paper
Minimum Number of Monotone Subsequences of Length 4 in Permutations2017-10-04Paper
Bounded colorings of multipartite graphs and hypergraphs2017-09-11Paper
Properly colored and rainbow copies of graphs with few cherries2016-11-25Paper
A note on acyclic vertex-colorings2016-11-22Paper
Properly colored and rainbow copies of graphs with few cherries2016-10-14Paper
Densities of 3-vertex graphs2016-10-07Paper
A problem of Erdős and Sós on 3-graphs2016-04-21Paper
Fractional coloring of triangle-free planar graphs2015-11-02Paper
Extensions of fractional precolorings show discontinuous behavior2014-11-17Paper
Extensions of fractional precolorings show discontinuous behavior2014-11-17Paper
Subcubic triangle-free graphs have fractional chromatic number at most \(14/5\)2014-07-28Paper
https://portal.mardi4nfdi.de/entity/Q54200122014-06-11Paper
A problem of Erdős and Sós on 3-graphs2014-06-11Paper
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs2012-12-14Paper
Extending fractional precolorings2012-09-12Paper
Fractional colorings of cubic graphs with large girth2012-03-15Paper
Domination number of cubic graphs with large girth2012-02-08Paper
Common graphs with arbitrary chromatic numberN/APaper
A tight lower bound on the minimal dispersionN/APaper
Tight Hamiltonicity from dense links of triplesN/APaper

Research outcomes over time

This page was built for person: Jan Volec