default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 38
Volume 38, Number 1, February 2018
- João Araújo
, Wolfram Bentz, Edward Dobson, Janusz Konieczny, Joy Morris:
Automorphism Groups of Circulant Digraphs With Applications to Semigroup Theory. 1-28 - Éric Balandraud, Fabio Tardella, Maurice Queyranne:
Largest Minimal Inversion-Complete and Pair-Complete Sets of Permutations. 29-41 - John Bamberg, Melissa Lee, Koji Momihara, Qing Xiang:
A New Infinite Family of Hemisystems of the Hermitian Surface. 43-66 - Aart Blokhuis, Hao Chen:
Selectively Balancing Unit Vectors. 67-74 - Tristram C. Bogart, Edward D. Kim:
Superlinear Subset Partition Graphs With Dimension Reduction, Strong Adjacency, and Endpoint Count. 75-114 - Gabe Cunningham:
Tight Chiral Polyhedra. 115-142 - Bence Csajbók:
On Bisecants of Rédei Type Blocking Sets and Applications. 143-166 - Jim Geelen, Rohan Kapadia:
Computing Girth and Cogirth in Perturbed Graphic Matroids. 167-191 - Rohan Kapadia:
The Extremal Functions of Classes of Matroids of Bounded Branch-Width. 193-218 - Misha Rudnev:
On the Number of Incidences Between Points and Planes in Three Dimensions. 219-254
Volume 38, Number 2, April 2018
- Daniele Bartoli, Massimo Giulietti, Giuseppe Marino, Olga Polverino:
Maximum Scattered Linear Sets and Complete Caps in Galois Spaces. 255-278 - David I. Bevan:
Intervals of Permutation Class Growth Rates. 279-303 - Nathan J. Bowler, Johannes Carmesin, Robin Christian:
Infinite Graphic Matroids. 305-339 - Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari:
Local Convergence of Random Graph Colorings. 341-380 - Reinhard Diestel, Malte Müller:
Connected Tree-Width. 381-398 - Nick Gill, Neil I. Gillespie, Jason Semeraro:
Conway Groupoids and Completely Transitive Codes. 399-442 - Carsten Lange, Vincent Pilaud:
Associahedra Via Spines. 443-486 - Adam Sheffer, Endre Szabó, Joshua Zahl:
Point-Curve Incidences in the Complex Plane. 487-499 - Jacob Fox, János Pach, Andrew Suk:
More Distinct Distances Under Local Conditions. 501-509
Volume 38, Number 3, June 2018
- Javier Cilleruelo, Rafael Tesoro:
On Sets Free of Sumsets with Summands of Prescribed Size. 511-546 - Venkatesan Guruswami, Euiwoong Lee:
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. 547-599 - Simao Herdade, John Kim, Swastik Kopparty:
A Cauchy-Davenport Theorem for Linear Maps. 601-618 - Carlos Hoppen, Nicholas C. Wormald:
Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs. 619-664 - Elchanan Mossel, Joe Neeman, Allan Sly:
A Proof of the Block Model Threshold Conjecture. 665-708 - Daniel Pellicer:
Cleaved Abstract Polytopes. 709-737 - Morgan Rodgers, Leo Storme, Andries Vansweevelt:
Cameron-Liebler k-Classes in PG(2k+1, q). 739-757
Volume 38, Number 4, August 2018
- Christine Bachoc, Oriol Serra, Gilles Zémor:
Revisiting Kneser's Theorem for Field Extensions. 759-777 - Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong:
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. 779-801 - Shaofei Du, Wenqin Xu, Guiying Yan:
2-Arc-Transitive Regular Covers of K n, n Having the Covering Transformation Group ℤ p 2. 803-826 - Agnieszka Figaj, Tomasz Luczak:
The Ramsey Numbers for A Triple of Long Cycles. 827-845 - Matthias Hamann:
Accessibility in Transitive Graphs. 847-859 - Kolja Knauer, Luis Pedro Montejano, Jorge Luis Ramírez Alfonsín:
How Many Circuits Determine an Oriented Matroid? 861-885 - Alexandr V. Kostochka, Matthew P. Yancey:
A Brooks-Type Result for Sparse Critical Graphs. 887-934 - Frantisek Matús:
Classes of Matroids Closed Under Minors and Principal Extensions. 935-954 - Rudi Pendavingh, Jorn G. van der Pol:
On the Number of Bases of Almost All Matroids. 955-985 - Guus Regts:
Zero-Free Regions of Partition Functions with Applications to Algorithms and Graph Limits. 987-1015 - Péter Komjáth:
Note A Ramsey Statement for Infinite Groups. 1017-1020
Volume 38, Number 5, October 2018
- Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt:
Chromatic Number of Ordered Graphs with Forbidden Ordered Subgraphs. 1021-1043 - Daniel W. Cranston, Landon Rabern:
Edge Lower Bounds for List Critical Graphs, Via Discharging. 1045-1065 - Mauro Di Nasso, Maria Riggio:
Fermat-Like Equations that are not Partition Regular. 1067-1078 - Peter Frankl:
Resilient Hypergraphs with Fixed Matching Number. 1079-1094 - Brandon Hanson:
The Additive Structure of Cartesian Products Spanning Few Distinct Distances. 1095-1100 - Rintaro Ikeshita, Shin-ichi Tanigawa:
Count Matroids of Group-Labeled Graphs. 1101-1127 - Gwenaël Joret, Piotr Micek, Veit Wiechert:
Sparsity and Dimension. 1129-1148 - Ben Lund:
Essential Dimension and the Flats Spanned by a Point Set. 1149-1174 - Péter Pál Pach, Csaba Sándor:
Multiplicative Bases and an Erdős Problem. 1175-1203 - Shubhangi Saraf, Ilya Volkovich:
Black-Box Identity Testing of Depth-4 Multilinear Circuits. 1205-1238 - Victor A. Vassiliev:
Topology of Complexes of Edge Covering Partite Graphs and Hypergraphs. 1239-1249 - Yujun Yang, Dong Ye:
Inverses of Bipartite Graphs. 1251-1263 - Tamás Fleiner:
A Note on Restricted List Edge-Colourings. 1265-1267 - Nabil H. Mustafa, Kunal Dutta, Arijit Ghosh:
A Simple Proof of Optimal Epsilon Nets. 1269-1277 - Sang-il Oum, Sounggun Wee:
A Remark on the Paper "Properties of Intersecting Families of Ordered Sets" by O. Einstein. 1279-1284
Volume 38, Number 6, December 2018
- Chidambaram Annamalai:
Finding Perfect Matchings in Bipartite Hypergraphs. 1285-1307 - M. Amin Bahmanian, Mike Newman:
Extending Factorizations of Complete Uniform Hypergraphs. 1309-1335 - Eli Berger, Zdenek Dvorák, Sergey Norin:
Treewidth of Grid Subsets. 1337-1352 - Türker Bíyíkoglu, Yusuf Civan:
Castelnuovo-Mumford Regularity of Graphs. 1353-1383 - Marcel Celaya:
On the Linear Span of Lattice Points in a Parallelepiped. 1385-1413 - David Gajser, Bojan Mohar:
Minimal Normal Graph Covers. 1415-1436 - Satoru Iwata, Yu Yokoi:
List Supermodular Coloring. 1437-1456 - Sofia Lindqvist:
Partition Regularity of Generalised Fermat Equations. 1457-1483 - András Mészáros:
Note a Note on Disjoint Dijoins. 1485-1488
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-09 23:39 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:
