Остановите войну!
for scientists:
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 36 matches
- 2021
- Noga Alon:
Explicit Expanders of Every Degree and Size. Comb. 41(4): 447-463 (2021) - Daniel Di Benedetto, József Solymosi, Ethan P. White:
On the Directions Determined by a Cartesian Product in an Affine Galois Plane. Comb. 41(6): 755-763 (2021) - Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot:
Packing and Covering Balls in Graphs Excluding a Minor. Comb. 41(3): 299-318 (2021) - Henning Bruhn, Matthias Heinlein, Felix Joos:
The Edge-Erdős-Pósa Property. Comb. 41(2): 147-173 (2021) - Matija Bucic, Dániel Korándi, Benny Sudakov:
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs. Comb. 41(3): 319-352 (2021) - Matija Bucic, Eoin Long, Asaf Shapira, Benny Sudakov:
Tournament Quasirandomness from Local Counting. Comb. 41(2): 175-208 (2021) - Jakub Byszewski, Jakub Konieczny, Elzbieta Krawczyk:
Substitutive Systems and a Finitary Version of Cobham's Theorem. Comb. 41(6): 765-801 (2021) - Michael Capalbo:
An Explicit Infinite Family of 필-Vertex Graphs with Maximum Degree K and Diameter $\left[ {1 + o\left( 1 \right)} \right]{\log _{K - 1}\mathbb{M}}$ for Each K - 1 a Prime Power. Comb. 41(3): 353-378 (2021) - Karthik Chandrasekhar, Richard Ehrenborg:
Bounds on the Number of Compatible k-Simplices Matching the Orientation of the (k - 1)-Skeleton of a Simplex. Comb. 41(2): 209-236 (2021) - Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Detecting a Long Odd Hole. Comb. 41(1): 1-30 (2021) - Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Pure Pairs. II. Excluding All Subdivisions of A Graph. Comb. 41(3): 379-405 (2021) - David Conlon, Joonkyung Lee, Oliver Janzer:
More on the Extremal Number of Subdivisions. Comb. 41(4): 465-494 (2021) - Bence Csajbók, Giuseppe Marino, Olga Polverino, Ferdinando Zullo:
Generalising the Scattered Property of Subspaces. Comb. 41(2): 237-262 (2021) - Bence Csajbók, Zsuzsa Weiner:
Generalizing Korchmáros - Mazzocca Arcs. Comb. 41(5): 601-623 (2021) - Gabriel Currier:
New Results on Simplex-Clusters in Set Systems. Comb. 41(4): 495-506 (2021) - Shaofei Du, Klavdija Kutnar, Dragan Marusic:
Resolving The Hamiltonian Problem for Vertex-Transitive Graphs of Order a Product of Two Primes. Comb. 41(4): 507-543 (2021) - Tai Do Duc:
New Constructions of Group-Invariant Butson Hadamard Matrices. Comb. 41(5): 625-644 (2021) - Joshua Erde, J. Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz:
Base Partition for Mixed Families of Finitary and Cofinitary Matroids. Comb. 41(1): 31-52 (2021) - Tao Feng, Weicong Li:
On Transitive Ovoids of Finite Hermitian Polar Spaces. Comb. 41(5): 645-667 (2021) - Jacob Fox, János Pach, Andrew Suk:
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. Comb. 41(6): 803-813 (2021) - Limor Friedman, Michael Krivelevich:
Cycle Lengths in Expanding Graphs. Comb. 41(1): 53-74 (2021) - Vincent Froese, Malte Renken:
Persistent Graphs and Cyclic Polytope Triangulations. Comb. 41(3): 407-423 (2021) - António Girão, Kamil Popielarz, Richard Snyder:
(2K + 1)-Connected Tournaments with Large Minimum Out-Degree are K-Linked. Comb. 41(6): 815-837 (2021) - Gary R. W. Greaves, Jeven Syatriadi, Pavlo Yatsyna:
Equiangular Lines in Low Dimensional Euclidean Spaces. Comb. 41(6): 839-872 (2021) - Venkatesan Guruswami, Nicolas Resch, Chaoping Xing:
Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs. Comb. 41(4): 545-579 (2021) - Yael Tauman Kalai, Ilan Komargodski, Ran Raz:
A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols. Comb. 41(1): 75-98 (2021) - Tali Kaufman, Izhar Oppenheim:
Erratum to: High Order Random Walks: Beyond Spectral Gap. Comb. 41(5): 749-753 (2021) - Jie Ma, Tianchi Yang:
Counting Critical Subgraphs in k-Critical Graphs. Comb. 41(5): 669-694 (2021) - Dragan Masulovic, Branislav Sobot:
Countable Ordinals and Big Ramsey Degrees. Comb. 41(3): 425-446 (2021) - Alexandr Polyanskii:
A Cap Covering Theorem. Comb. 41(5): 695-702 (2021)
skipping 6 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-05-25 15:45 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