default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 42
Volume 42, Number 1, February 2022
- Karim A. Adiprasito
, Sergey Avvakumov, Roman N. Karasev:
A Subexponential Size Triangulation of ℝPn. 1-8 - Dana Bartosová, Jordi Lopez-Abad, Martino Lupini, Brice Mbombo:
The Ramsey Properties for Grassmannians Over ℝ, ℂ. 9-69 - Brandon Hanson, Oliver Roche-Newton, Misha Rudnev:
Higher Convexity and Iterated Sum Sets. 71-85 - Daniel Král', Jonathan A. Noel, Sergey Norin, Jan Volec, Fan Wei:
Non-Bipartite K-Common Graphs. 87-114 - Tomasz Luczak, Joanna Polcyn, Christian Reiher:
On the Ramsey-Turán Density of Triangles. 115-136 - Sergey Norin, Zi-Xia Song:
A New Upper Bound on the Chromatic Number of Graphs with No Odd Kt Minor. 137-149
Volume 42, Number 2, April 2022
- Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood:
Stack-Number is Not Bounded by Queue-Number. 151-164 - François Hennecart, Gyan Prakash, Pramod Eyyunni:
On Thin Sum-Product Bases. 165-202 - Dávid Matolcsi, Imre Z. Ruzsa, George Shakan, Dmitrii Zhelezov:
An Analytic Approach to Cardinalities of Sumsets. 203-236 - Arnold Neumaier, Safet Penjic:
On Bounding the Diameter of a Distance-Regular Graph. 237-251 - Luke Postle, Evelyne Smith-Roberge:
On the Density of C7-Critical Graphs. 253-300 - Claude Tardif:
The Chromatic Number of the Product of 14-Chromatic Graphs Can BE 13. 301-308
Volume 42, Number 3, June 2022
- David Conlon, Jacob Fox, Yuval Wigderson:
Ramsey Numbers of Books and Quasirandomness. 309-363 - Jan Grebík, Israel Rocha:
Fractional Isomorphism of Graphons. 365-404 - Tony Huynh, Gwenaël Joret, Piotr Micek, Michal T. Seweryn, Paul Wollan:
Excluding a Ladder. 405-432 - Xizhi Liu, Dhruv Mubayi:
A Hypergraph Turán Problem with No Stability. 433-462
Volume 42, Number 4, August 2022
- Jana Cslovjecsek, Romanos-Diogenes Malikiosis, Márton Naszódi, Matthias Schymura:
Computing the Covering Radius of a Polytope with an Application to Lonely Runners. 463-490 - Sean Eberhard:
The Characteristic Polynomial of a Random Matrix. 491-527 - Maxime Bourque-Fortin, Bram Petri:
Kissing Numbers of Regular Graphs. 529-551 - Gábor Kun:
On Gardner's Conjecture. 553-558 - Zhicong Lin, Dongsu Kim:
A Combinatorial Bijection on k-Noncrossing Partitions. 559-586 - Pavel Pudlák, Vojtech Rödl:
Extractors for Small Zero-Fixing Sources. 587-616
Volume 42, Number 5, October 2022
- Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill:
Lower Bounds on the Chromatic Number of Random Graphs. 617-658 - Martin Balko, David Chodounský, Jan Hubicka, Matej Konecný, Lluís Vena:
Big Ramsey Degrees of 3-Uniform Hypergraphs Are Finite. 659-672 - Daniele Bartoli, Giacomo Micheli:
Algebraic Constructions of Complete m-Arcs. 673-700 - Drago Bokal, Zdenek Dvorák, Petr Hlinený, Jesús Leaños, Bojan Mohar, Tilo Wiedera:
Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c ≤ 12. 701-728 - Tsz Ho Chan, Jared D. Lichtman, Carl Pomerance:
On the Critical Exponent for k-Primitive Sets. 729-747 - Bodo Lass:
Calculating the Euler Characteristic of the Moduli Space of Curves. 749-762 - Max Pitz:
Constructing Tree-Decompositions That Display All Topological Ends. 763-769
Volume 42, Number 6, December 2022
- Stefan Ehard, Felix Joos:
A Short Proof of the Blow-Up Lemma for Approximate Decompositions. 771-819 - Gábor Elek, Gábor Tardos:
Convergence and Limits of Finite Trees. 821-852 - Jeff Kahn, Jinyoung Park:
The Number of Maximal Independent Sets in the Hamming Cube. 853-880 - Hadi Kharaghani, Thomas Pender, Sho Suda:
A Family of Balanced Generalized Weighing Matrices. 881-894 - Abhishek Methuku, István Tomon:
Bipartite Turán Problems for Ordered Graphs. 895-911 - Ron Aharoni, Eli Berger, Joseph Briggs, Erel Segal-Halevi, Shira Zerbib:
Fractionally Balanced Hypergraphs and Rainbow KKM Theorems. 913-951 - Daniele Bartoli, Nicola Durante:
On the Classification of Low-Degree Ovoids of Q(4,q). 953-969 - Amitabh Basu, Michele Conforti, Marco Di Summa, Hongyi Jiang:
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II. 971-996 - Manuel Bodirsky, Florian Starke:
Maximal Digraphs with Respect to Primitive Positive Constructability. 997-1010 - Swee Hong Chan, Igor Pak, Greta Panova:
Log-Concavity in Planar Random Walks. 1011-1026 - Gábor Damásdi, Dömötör Pálvölgyi:
Realizing an m-Uniform Four-Chromatic Hypergraph with Disks. 1027-1048 - James Davies:
Vertex-Minor-Closed Classes are χ-Bounded. 1049-1079 - Zdenek Dvorák, Luke Postle:
On Decidability of Hyperbolicity. 1081-1098 - Ronen Eldan:
Second-Order Bounds on Correlations Between Increasing Families. 1099-1118 - Nóra Frankl, Andrey Kupavskii:
Almost Sharp Bounds on the Number of Discrete Chains in the Plane. 1119-1143 - Lior Gishboliner, Raphael Steiner, Tibor Szabó:
Oriented Cycles in Digraphs of Large Outdegree. 1145-1187 - Rani Hod, Michael Krivelevich, Tobias Müller, Alon Naor, Nicholas C. Wormald:
Component Games on Random Graphs. 1189-1229
Volume 42, Number Supplement 2, December 2022
- Zach Hunter:
Improved Lower Bounds for Van Der Waerden Numbers. 1231-1252 - Yoichi Iwata, Yutaro Yamaguchi:
Finding a Shortest Non-Zero Path in Group-Labeled Graphs. 1253-1282 - Támás Kalmán, Seunghun Lee, Lilla Tóthmérész:
The Sandpile Group of a Trinity and a Canonical Definition for the Planar Bernardi Action. 1283-1316 - Vojtech Kaluza, Martin Tancer:
Even Maps, the Colin de Verdière Number and Representations of Graphs. 1317-1345 - Hemanshu Kaul, Benjamin Reiniger:
A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt. 1347-1356 - Hong Liu, Péter Pál Pach, Csaba Sándor:
Polynomial Schur's Theorem. 1357-1384 - Matei Mandache:
Finding Certain Arithmetic Progressions in 2-Coloured Cyclic Groups. 1385-1408 - Tomás Masarík, Irene Muzi, Marcin Pilipczuk, Pawel Rzazewski, Manuel Sorge:
Packing Directed Cycles Quarter- and Half-Integrally. 1409-1438 - Andrew Newman:
A Lower Bound on the Number of Homotopy Types of Simplicial Complexes on N Vertices. 1439-1450 - Kenta Ozeki:
Kempe Equivalence Classes of Cubic Graphs Embedded on the Projective Plane. 1451-1480 - Hector Pasten:
On the Chevalley-Warning Theorem When the Degree Equals the Number of Variables. 1481-1486 - Jakub Przybylo:
The 1-2-3 Conjecture Holds for Graphs with Large Enough Minimum Degree. 1487-1512 - Chao Shi, Peter Frankl, Jianguo Qian:
On Non-Empty Cross-Intersecting Families. 1513-1525
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-12-04 22:09 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:
