default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 40
Volume 40, Number 1, February 2020
- Robert Connelly, Steven J. Gortler, Louis Theran
:
Generically Globally Rigid Graphs Have Generic Universally Rigid Frameworks. 1-37 - Oliver Ebsen, Mathias Schacht:
Homomorphism Thresholds for Odd Cycles. 39-62 - He Guo, Lutz Warnke:
Packing Nearly Optimal Ramsey R(3, t) Graphs. 63-103 - Jie Ma, Bo Ning:
Stability Results on the Circumference of a Graph. 105-147
Volume 40, Number 2, April 2020
- Noga Alon, Mrinal Kumar, Ben Lee Volk:
Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. 149-178 - Peter J. Ayre, Amin Coja-Oghlan, Pu Gao, Noëla Müller:
The Satisfiability Threshold For Random Linear Equations. 179-235 - John Chiarelli, Pooya Hatami, Michael E. Saks:
An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean function. 237-244 - Tali Kaufman, Izhar Oppenheim:
High Order Random Walks: Beyond Spectral Gap. 245-281 - Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran:
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs. 283-305
Volume 40, Number 3, June 2020
- Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe:
A Construction for Clique-Free Pseudorandom Graphs. 307-314 - Asaf Ferber, Vishesh Jain, Benny Sudakov:
Number of 1-Factorizations of Regular High-Degree Graphs. 315-344 - Alexander L. Gavrilyuk, Sho Suda, Janos Vidali:
On Tight 4-Designs in Hamming Association Schemes. 345-362 - Stefan Glock, Daniela Kühn, Allan Lo, Deryk Osthus:
On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems. 363-403 - Ervin Györi, Michael D. Plummer, Dong Ye, Xiaoya Zha:
Cycle Traversability for Claw-Free Graphs and Polyhedral Maps. 405-433 - Gergely Harcos, Daniel Soltész:
New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs. 435-454
Volume 40, Number 4, August 2020
- Grigoriy Blekherman, Annie Raymond, Mohit Singh, Rekha R. Thomas:
Simple Graph Density Inequalities with No Sum of Squares Proofs. 455-471 - Michael Chapman, Nati Linial, Yuval Peled:
Expander Graphs - Both Local and Global. 473-509 - Alexander Clifton, Hao Huang:
On Almost k-Covers of Hypercubes. 511-526 - Andreas F. Holmsen:
Large Cliques in Hypergraphs with Forbidden Substructures. 527-537 - Karthik C. S., Pasin Manurangsi:
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. 539-573 - Paul D. Seymour, Sophie Spirkl:
Short Directed Cycles in Bipartite Digraphs. 575-599 - Alexander F. Sidorenko:
Weakly Norming Graphs are Edge-Transitive. 601-604
Volume 40, Number 5, November 2020
- Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee:
Intersecting Restrictions in Clutters. 605-623 - Ilkyoo Choi, Daniel W. Cranston, Théo Pierron:
Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles. 625-653 - Stefan Felsner, Tamás Mészáros, Piotr Micek:
Boolean Dimension and Tree-Width. 655-677 - Stefan Glock, Felix Joos, Daniela Kühn, Deryk Osthus:
Euler Tours in Hypergraphs. 679-690 - Christian Lindorfer, Wolfgang Woess:
The Language of Self-Avoiding Walks. 691-720 - Orit E. Raz, Zvi Shem-Tov:
Expanding Polynomials: A Generalization of the Elekes-Rónyai Theorem to d Variables. 721-748 - Misha Rudnev:
Note on the Number of Hinges Defined by a Point Set in ℝ2. 749-757
Volume 40, Number 6, December 2020
- Zdenek Dvorák, Patrice Ossona de Mendez, Hehui Wu:
1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio. 759-774 - Chaim Even-Zohar:
Patterns in Random Permutations. 775-804 - Zouhaier Ferchiou, Bertrand Guenin:
A Short Proof of Shih's Isomorphism Theorem on Graphic Subspaces. 805-837 - Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood:
Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. 839-868 - Andrey Kupavskii:
The VC-Dimension of K-Vertex D-Polytopes. 869-874 - Yufei Zhao, Yunkun Zhou:
Impartial Digraphs. 875-896
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.
last updated on 2025-11-02 20:56 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:
