default search action
Anita Liebenau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]József Balogh, Anita Liebenau, Letícia Mattos, Natasha Morrison:
On Multicolor Turán Numbers. SIAM J. Discret. Math. 38(3): 2297-2311 (2024) - 2023
- [j19]Anita Liebenau
, Nick Wormald:
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence. Random Struct. Algorithms 62(2): 259-286 (2023) - [j18]Anita Liebenau
Asymmetric Ramsey properties of random graphs involving cliques and cycles. Random Struct. Algorithms 62(4): 1035-1055 (2023) - [j17]Anurag Bishnoi, Simona Boyadzhiyska
On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles. SIAM J. Discret. Math. 37(1): 25-50 (2023) - 2022
- [j16]Anita Liebenau
The threshold bias of the clique-factor game. J. Comb. Theory B 152: 221-247 (2022) - 2021
- [j15]Nina Kamcev
The Size Ramsey Number of Graphs with Bounded Treewidth. SIAM J. Discret. Math. 35(1): 281-293 (2021) - 2020
- [j14]Dennis Clemens
On minimal Ramsey graphs and Ramsey equivalence in multiple colours. Comb. Probab. Comput. 29(4): 537-554 (2020) - [j13]Anita Liebenau
An approximate version of Jackson's conjecture. Comb. Probab. Comput. 29(6): 886-899 (2020) - [j12]Carly Bodkin
Most binary matrices have no small defining set. Discret. Math. 343(10): 112035 (2020) - [i5]Anita Liebenau, Nick Wormald:
Asymptotic enumeration of digraphs and bipartite graphs by degree sequence. CoRR abs/2006.15797 (2020)
2010 – 2019
- 2019
- [j11]Anita Liebenau
Caterpillars in Erdős-Hajnal. J. Comb. Theory B 136: 33-43 (2019) - [i4]Nina Kamcev, Anita Liebenau
The size Ramsey number of graphs with bounded treewidth. CoRR abs/1906.09185 (2019) - 2018
- [j10]Krzysztof Choromanski, Dvir Falik, Anita Liebenau
Excluding Hooks and their Complements. Electron. J. Comb. 25(3): 3 (2018) - [j9]Thomas F. Bloom, Anita Liebenau:
Ramsey equivalence of Kn and Kn+Kn-1. Electron. J. Comb. 25(3): P3.4 (2018) - [i3]Anita Liebenau, Marcin Pilipczuk, Paul D. Seymour, Sophie Spirkl:
Caterpillars in Erdős-Hajnal. CoRR abs/1810.00811 (2018) - 2017
- [j8]Frantisek Kardos, Daniel Král'
First order convergence of matroids. Eur. J. Comb. 59: 150-168 (2017) - [j7]Dennis Clemens
A non-trivial upper bound on the threshold bias of the Oriented-cycle game. J. Comb. Theory B 122: 21-54 (2017) - [i2]Anita Liebenau, Marcin Pilipczuk:
The Erdős-Hajnal conjecture for caterpillars and their complements. CoRR abs/1710.08701 (2017) - 2016
- [j6]Dennis Clemens
The Random Graph Intuition for the Tournament Game. Comb. Probab. Comput. 25(1): 76-88 (2016) - [j5]Jacob Fox
On the minimum degree of minimal Ramsey graphs for multiple colours. J. Comb. Theory B 120: 64-82 (2016) - 2015
- [j4]Roman Glebov, Anita Liebenau
On the Concentration of the Domination Number of the Random Graph. SIAM J. Discret. Math. 29(3): 1186-1206 (2015) - [j3]Dennis Clemens
Building Spanning Trees Quickly in Maker-Breaker Games. SIAM J. Discret. Math. 29(3): 1683-1705 (2015) - [i1]Frantisek Kardos, Daniel Král, Anita Liebenau, Lukás Mach:
First order convergence of matroids. CoRR abs/1501.06518 (2015) - 2014
- [j2]Jacob Fox, Andrey Grinshpun, Anita Liebenau
What is Ramsey-equivalent to a clique? J. Comb. Theory B 109: 120-133 (2014) - 2012
- [j1]Dennis Clemens
Fast Strategies In Maker-Breaker Games Played on Random Boards. Comb. Probab. Comput. 21(6): 897-915 (2012)
Coauthor Index
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-09-21 01:44 CEST 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: