default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 1,489 matches
- 2024
- Igor Araujo, József Balogh, Robert A. Krueger, Simón Piga, Andrew Treglown:
On oriented cycles in randomly perturbed digraphs. Comb. Probab. Comput. 33(2): 157-178 (2024) - Maria Axenovich:
A class of graphs of zero Turán density in a hypercube. Comb. Probab. Comput. 33(3): 404-410 (2024) - Maria Axenovich, Domagoj Bradac, Lior Gishboliner, Dhruv Mubayi, Lea Weber:
Large cliques or cocliques in hypergraphs with forbidden order-size pairs. Comb. Probab. Comput. 33(3): 286-299 (2024) - Grigoriy Blekherman, Shyamal Patel:
Threshold graphs maximise homomorphism densities. Comb. Probab. Comput. 33(3): 300-318 (2024) - Stijn Cambie, Jun Gao, Hong Liu:
Many Hamiltonian subsets in large graphs with given density. Comb. Probab. Comput. 33(1): 110-120 (2024) - Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood:
Product structure of graph classes with bounded treewidth. Comb. Probab. Comput. 33(3): 351-376 (2024) - Mario Correddu, Dario Trevisan:
On minimum spanning trees for random Euclidean bipartite graphs. Comb. Probab. Comput. 33(3): 319-350 (2024) - Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich:
Percolation on irregular high-dimensional product graphs. Comb. Probab. Comput. 33(3): 377-403 (2024) - Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. Comb. Probab. Comput. 33(1): 85-90 (2024) - Olivier Fischer, Raphael Steiner:
On the choosability of -minor-free graphs. Comb. Probab. Comput. 33(2): 129-142 (2024) - Peter Frankl, Jian Wang:
Intersecting families without unique shadow. Comb. Probab. Comput. 33(1): 91-109 (2024) - David J. Galvin, Gwen McKinley, Will Perkins, Michail Sarantis, Prasad Tetali:
On the zeroes of hypergraph independence polynomials. Comb. Probab. Comput. 33(1): 65-84 (2024) - Lampros Gavalakis:
Approximate discrete entropy monotonicity for log-concave sums. Comb. Probab. Comput. 33(2): 196-209 (2024) - Andrzej Grzesik, Daniel Král', Oleg Pikhurko:
Forcing generalised quasirandom graphs efficiently. Comb. Probab. Comput. 33(1): 16-31 (2024) - Jie Han, Jie Hu, Lidan Ping, Guanghui Wang, Yi Wang, Donglei Yang:
Spanning trees in graphs without large bipartite holes. Comb. Probab. Comput. 33(3): 270-285 (2024) - Matthew Jenssen, Marcus Michelen, Mohan Ravichandran:
Quasipolynomial-time algorithms for Gibbs point processes. Comb. Probab. Comput. 33(1): 1-15 (2024) - Noe Kawamoto, Akira Sakai:
Spread-out limit of the critical points for lattice trees and lattice animals in dimensions. Comb. Probab. Comput. 33(2): 238-269 (2024) - Tom Kelly, Daniela Kühn, Deryk Osthus:
A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree. Comb. Probab. Comput. 33(2): 179-195 (2024) - Piet Lammers, Fabio Lucio Toninelli:
Height function localisation on trees. Comb. Probab. Comput. 33(1): 50-64 (2024) - Yassine El Maazouz, Jim Pitman:
The Bernoulli clock: probabilistic and combinatorial interpretations of the Bernoulli polynomials by circular convolution. Comb. Probab. Comput. 33(2): 210-237 (2024) - Anders Martinsson, Pascal Su:
Mastermind with a linear number of queries. Comb. Probab. Comput. 33(2): 143-156 (2024) - Matías Pavez-Signé:
Spanning subdivisions in Dirac graphs. Comb. Probab. Comput. 33(1): 121-128 (2024) - Dmitrii Zakharov:
On the size of maximal intersecting families. Comb. Probab. Comput. 33(1): 32-49 (2024) - 2023
- Jie Han, Ping Hu, Guanghui Wang, Donglei Yang:
Clique-factors in graphs with sublinear ?-independence number. Comb. Probab. Comput. 32(4): 665-681 (2023) - Tao Jiang, Sean Longbrake, Jie Ma:
Bipartite-ness under smooth conditions. Comb. Probab. Comput. 32(4): 546-558 (2023) - Noga Alon, Fan Wei:
Irregular subgraphs. Comb. Probab. Comput. 32(2): 269-283 (2023) - James Anderson, Anton Bernshteyn, Abhishek Dhawan:
Colouring graphs with forbidden bipartite subgraphs. Comb. Probab. Comput. 32(1): 45-67 (2023) - George Andriopoulos:
Convergence of blanket times for sequences of random walks on critical random graphs. Comb. Probab. Comput. 32(3): 478-515 (2023) - Richard Arratia, E. Rodney Canfield, Alfred W. Hales:
Random feedback shift registers and the limit distribution for largest cycle lengths. Comb. Probab. Comput. 32(4): 559-593 (2023) - Maria Axenovich, Christian Winter:
Poset Ramsey numbers: large Boolean lattice versus a fixed poset. Comb. Probab. Comput. 32(4): 638-653 (2023)
skipping 1,459 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-06 12:00 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint