default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Volec
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Matej Trödler, Jan Volec, Jan Vybíral:
A tight lower bound on the minimal dispersion. Eur. J. Comb. 120: 103945 (2024)- 2023
- [j25]Robert Hancock, Adam Kabela, Daniel Král'
, Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec:
No additional tournaments are quasirandom-forcing. Eur. J. Comb. 108: 103632 (2023) - [j24]Andrzej Grzesik, Daniel Král', László Miklós Lovász, Jan Volec:
Cycles of a given length in tournaments. J. Comb. Theory B 158(Part): 117-145 (2023) - [j23]Robert Hancock, Daniel Král', Matjaz Krnc, Jan Volec:
Toward characterizing locally common graphs. Random Struct. Algorithms 62(1): 181-218 (2023) - [j22]József Balogh, Felix Christian Clemen, Bernard Lidický, Sergey Norin, Jan Volec:
The Spectrum of Triangle-Free Graphs. SIAM J. Discret. Math. 37(2): 1173-1179 (2023) - [i5]Matej Trödler, Jan Volec, Jan Vybíral:
A tight lower bound on the minimal dispersion. CoRR abs/2311.10666 (2023) - 2022
- [j21]Daniel Král', Jonathan A. Noel, Sergey Norin, Jan Volec, Fan Wei:
Non-Bipartite K-Common Graphs. Comb. 42(1): 87-114 (2022) - [j20]Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec:
On tripartite common graphs. Comb. Probab. Comput. 31(5): 907-923 (2022) - [j19]Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, Jan Volec:
Counterexamples to a Conjecture of Harris on Hall Ratio. SIAM J. Discret. Math. 36(3): 1678-1686 (2022) - 2021
- [j18]Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec:
Sharp bounds for decomposing graphs into edges and triangles. Comb. Probab. Comput. 30(2): 271-287 (2021) - 2020
- [j17]Timothy F. N. Chan, Daniel Král', Jonathan A. Noel, Yanitsa Pehova, Maryam Sharifzadeh, Jan Volec:
Characterization of quasirandom permutations by a pattern sum. Random Struct. Algorithms 57(4): 920-939 (2020)
2010 – 2019
- 2019
- [j16]Andrzej Grzesik, Ping Hu, Jan Volec:
Minimum number of edges that occur in odd cycles. J. Comb. Theory B 137: 65-103 (2019) - [j15]Daniel Král', Sergey Norin, Jan Volec:
A bound on the inducibility of cycles. J. Comb. Theory A 161: 359-363 (2019) - [i4]Robert Hancock, Adam Kabela, Daniel Král, Taísa L. Martins, Roberto Parente, Fiona Skerman, Jan Volec:
No additional tournaments are quasirandom-forcing. CoRR abs/1912.04243 (2019) - 2017
- [j14]Nina Kamcev, Benny Sudakov, Jan Volec:
Bounded colorings of multipartite graphs and hypergraphs. Eur. J. Comb. 66: 235-249 (2017) - [j13]Victor Falgas-Ravry, Oleg Pikhurko, Emil R. Vaughan, Jan Volec:
The codegree threshold of K4-. Electron. Notes Discret. Math. 61: 407-413 (2017) - [j12]Benny Sudakov, Jan Volec:
Properly colored and rainbow copies of graphs with few cherries. J. Comb. Theory B 122: 391-416 (2017) - [j11]József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young:
Rainbow triangles in three-colored graphs. J. Comb. Theory B 126: 83-113 (2017) - 2016
- [i3]Andrzej Grzesik, Ping Hu, Jan Volec:
Minimum number of edges that occur in odd cycles. CoRR abs/1605.09055 (2016) - 2015
- [j10]Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec:
Fractional Coloring of Triangle-Free Planar Graphs. Electron. J. Comb. 22(4): 4 (2015) - [j9]József Balogh, Ping Hu, Bernard Lidický, Oleg Pikhurko, Balázs Udvari, Jan Volec:
Minimum Number of Monotone Subsequences of Length 4 in Permutations. Comb. Probab. Comput. 24(4): 658-679 (2015) - [j8]Benny Sudakov, Jan Volec:
Properly colored and rainbow copies of graphs with few cherries. Electron. Notes Discret. Math. 49: 315-321 (2015) - [c2]Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos, Jean-Sébastien Sereni, Jan Volec:
Limits of Order Types. SoCG 2015: 300-314 - 2014
- [j7]Jan van den Heuvel, Daniel Král, Martin Kupec, Jean-Sébastien Sereni, Jan Volec:
Extensions of Fractional Precolorings Show Discontinuous Behavior. J. Graph Theory 77(4): 299-329 (2014) - [j6]Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec:
Subcubic triangle-free graphs have fractional chromatic number at most 14/5. J. Lond. Math. Soc. 89(3): 641-662 (2014) - 2013
- [j5]Roman Glebov, Daniel Král', Jan Volec:
An application of flag algebras to a problem of Erdős and Sós. Electron. Notes Discret. Math. 43: 171-177 (2013) - [i2]Zdenek Dvorák, Jean-Sébastien Sereni, Jan Volec:
Subcubic triangle-free graphs have fractional chromatic number at most 14/5. CoRR abs/1301.5296 (2013) - 2012
- [j4]Daniel Král', Petr Skoda, Jan Volec:
Domination number of cubic graphs with large girth. J. Graph Theory 69(2): 131-142 (2012) - [j3]Frantisek Kardos, Daniel Král', Jan Volec:
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs. Random Struct. Algorithms 41(4): 506-520 (2012) - [j2]Daniel Král', Matjaz Krnc, Martin Kupec, Borut Luzar, Jan Volec:
Extending Fractional Precolorings. SIAM J. Discret. Math. 26(2): 647-660 (2012) - 2011
- [j1]Frantisek Kardos, Daniel Král', Jan Volec:
Fractional colorings of cubic graphs with large girth. SIAM J. Discret. Math. 25(3): 1454-1476 (2011) - [c1]Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec:
On the Complexity of Planar Covering of Small Graphs. WG 2011: 83-94 - [i1]Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec:
On the Complexity of Planar Covering of Small Graphs. CoRR abs/1108.0064 (2011)
Coauthor Index
aka: Daniel Král'
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-05 21:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
