default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 39
Volume 39, Number 1, February 2019
- Henning Bruhn, Matthias Heinlein, Felix Joos:
Long Cycles have the Edge-Erdős-Pósa Property. 1-36 - Reinhard Diestel, Fabian Hundertmark, Sahar Lemanczyk:
Profiles of Separations: in Graphs, Matroids, and Beyond. 37-75 - Jirí Fink
:
Matchings Extend into 2-Factors in Hypercubes. 77-84 - Ron Holzman, Nitzan Tur:
Simultaneous Linear Discrepancy for Unions of Intervals. 85-90 - Tony Huynh, Felix Joos, Paul Wollan:
A Unified Erdős-Pósa Theorem for Constrained Cycles. 91-133 - Michael Krivelevich:
Long Cycles in Locally Expanding Graphs, with Applications. 135-151 - Andrey Kupavskii, János Pach, István Tomon:
On the Size of K-Cross-Free Families. 153-164 - Chris Lambie-Hanson, Assaf Rinot:
Reflection on the Coloring and Chromatic Numbers. 165-214 - Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon:
Ramsey Graphs Induce Subgraphs of Many Different Sizes. 215-237
Volume 39, Number 2, April 2019
- Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le, Stéphan Thomassé:
Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture. 239-263 - Sally Dong, Jim Geelen:
Improved Bounds for Rota's Basis Conjecture. 265-272 - Sean Eberhard, Stefan-Christoph Virchow:
The Probability of Generating the Symmetric Group. 273-288 - Alexander L. Gavrilyuk, Jack H. Koolen:
A Characterization of the Graphs of Bilinear (d×d)-Forms over F2. 289-32 - Ashish Goel, Michael Kapralov, Sanjeev Khanna:
Perfect Matchings in Õ (n 1.5) Time in Regular Bipartite Graphs. 323-354 - Choongbum Lee, Brandon Tran:
The Sub-Exponential Transition for the Chromatic Generalized Ramsey Numbers. 355-376 - Patrice Ossona de Mendez, Sang-il Oum, David R. Wood:
Defective Colouring of Graphs Excluding A Subgraph or Minor. 377-410 - Thang Van Pham, Le Anh Vinh, Frank de Zeeuw:
Three-Variable Expanding Polynomials and Higher-Dimensional Distinct Distances. 411-426 - Naser T. Sardari:
Diameter of Ramanujan Graphs and Random Cayley Graphs. 427-446 - Pablo Soberón:
Tverberg Partitions as Weak Epsilon-Nets. 447-458 - Yu Yokoi:
List Supermodular Coloring with Shorter Lists. 459-475
Volume 39, Number 3, June 2019
- Pavle V. M. Blagojevic, Albert Haase, Günter M. Ziegler:
Tverberg-Type Theorems for Matroids: A Counterexample and a Proof. 477-500 - Maarten De Boeck, Geertrui Van de Voorde:
Elation KM-Arcs. 501-544 - Johannes Carmesin:
All Graphs Have Tree-Decompositions Displaying Their Topological Ends. 545-596 - Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran:
Twenty (Short) Questions. 597-626 - Florian Frick, Shira Zerbib:
Colorful Coverings of Polytopes and Piercing Numbers of Colorful d-Intervals. 627-637 - Lior Gishboliner, Asaf Shapira:
Efficient Removal Without Efficient Regularity. 639-658 - Stefanie Huber, Stefan Geschke, Menachem Kojman:
Partitioning Subgraphs of Profinite Ordered Graphs. 659-678 - Dhruv Mubayi, Lujia Wang:
The Number of Triple Systems Without Even Cycles. 679-704 - Cosmin Pohoata, Adam Sheffer:
Local Properties in Colored Graphs, Distinct Distances, and Difference Sets. 705-714
Volume 39, Number 4, August 2019
- Ahmad Abdi, Bertrand Guenin:
The Minimally Non-Ideal Binary Clutters with a Triangle. 719-752 - Ahmad Abdi, Bertrand Guenin:
The Two-Point Fano and Ideal Binary Clutters. 753-777 - Hyungryul Baik, Bram Petri, Jean Raimbault:
Subgroup Growth of Virtually Cyclic Right-Angled Coxeter Groups and Their Free Products. 779-811 - Yong-Gao Chen, Jin-Hui Fang:
Additive Complements with Narkiewicz's Condition. 813-823 - Carolyn Chun, James G. Oxley:
Internally 4-Connected Binary Matroids with Every Element in Three Triangles. 825-845 - Louis DeBiasio, Paul McKenney:
Density of Monochromatic Infinite Subgraphs. 847-878 - Reinhard Diestel, Sang-il Oum:
Tangle-Tree Duality: In Graphs, Matroids and Beyond. 879-910 - Tomas Juskevicius, Grazvydas Semetulskis:
Optimal Littlewood-Offord Inequalities in Groups. 911-921 - Danny Nguyen, Igor Pak:
VC-Dimensions of Short Presburger Formulas. 923-932 - Mustazee Rahman, Bálint Virág, Máté Vizer:
Geometry of Permutation Limits. 933-960
Volume 39, Number 5, November 2019
- Louis Bellmann, Christian Reiher:
Turán's Theorem for the Fano Plane. 961-982 - Maria Chudnovsky, Jacob Fox, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Towards Erdős-Hajnal for Graphs with No 5-Hole. 983-991 - Agelos Georgakopoulos, Matthias Hamann:
The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs. 993-1019 - Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé:
Coloring Dense Digraphs. 1021-1053 - Gwenaël Joret, Piotr Micek, Patrice Ossona de Mendez, Veit Wiechert:
Nowhere Dense Graph Classes and Dimension. 1055-1079 - Rose McCarty, Robin Thomas:
The Extremal Function for Bipartite Linklessly Embeddable Graphs. 1081-1104 - Alex D. Scott, Paul D. Seymour:
Induced Subgraphs of Graphs With Large Chromatic Number. X. Holes of Specific Residue. 1105-1132 - Uri Shapira, Reut Zuck:
Asymptotic Metric Behavior of Random Cayley Graphs of Finite Abelian Groups. 1133-1148 - Adam Bene Watts, Sergey Norin, Liana Yepremyan:
A Turán Theorem for Extensions Via an Erdős-Ko-Rado Theorem for Lagrangians. 1149-1171 - Jeroen Zuiddam:
The Asymptotic Spectrum of Graphs and the Shannon Capacity. 1173-1184 - Shahram Mohsenipour, Saharon Shelah:
On Finitary Hindman Numbers. 1185-1189
Volume 39, Number 6, December 2019
- Ron Aharoni, Ron Holzman, Zilin Jiang:
Rainbow Fractional Matchings. 1191-1202 - Daniela A. Amato:
Highly-Arc-Transitive and Descendant-Homogeneous Digraphs with Finite Out-Valency. 1203-1223 - Nathan J. Bowler, Johannes Carmesin, Péter Komjáth, Christian Reiher:
The Colouring Number of Infinite Graphs. 1225-1235 - Zdenek Dvorák, Bojan Mohar, Robert Sámal:
Exponentially Many Nowhere-Zero ℤ3-, ℤ4-, and ℤ6-Flows. 1237-1253 - Peter Frankl, Andrey Kupavskii:
Incompatible Intersection Properties. 1255-1266 - Radoslav Fulek, Jan Kyncl:
Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4. 1267-1279 - Yahya Ould Hamidoune:
Hyper-Atoms Applied to the Critical Pair Theory. 1281-1315 - Attila Joó:
Vertex-Flames in Countable Rooted Digraphs Preserving an Erdős-Menger Separation for Each Vertex. 1317-1333 - Daniel M. Kane, Carlo Sanna, Jeffrey O. Shallit:
Waring's Theorem for Binary Powers. 1335-1350 - Martin Nägele, Benny Sudakov, Rico Zenklusen:
Submodular Minimization Under Congruency Constraints. 1351-1386 - Sergey Norin, Alex Scott, Paul D. Seymour, David R. Wood:
Clustered Colouring in Minor-Closed Classes. 1387-1412 - Neil Robertson, Paul D. Seymour, Robin Thomas:
Girth Six Cubic Graphs Have Petersen Minors. 1413-1423 - Ferdinand Ihringer, Hajime Tanaka:
The Independence Number of the Orthogonality Graph in Dimension 2k. 1425-1428
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:
