Journal: Combinatorica

Volume 40, Issue 6

759 -- 774Zdenek Dvorák, Patrice Ossona de Mendez, Hehui Wu. 1-Subdivisions, the Fractional Chromatic Number and the Hall Ratio
775 -- 804Chaim Even-Zohar. Patterns in Random Permutations
805 -- 837Zouhaier Ferchiou, Bertrand Guenin. A Short Proof of Shih's Isomorphism Theorem on Graphic Subspaces
839 -- 868Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood. Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth
869 -- 874Andrey Kupavskii. The VC-Dimension of K-Vertex D-Polytopes
875 -- 896Yufei Zhao, Yunkun Zhou. Impartial Digraphs

Volume 40, Issue 5

605 -- 623Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee. Intersecting Restrictions in Clutters
625 -- 653Ilkyoo Choi, Daniel W. Cranston, Théo Pierron. Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles
655 -- 677Stefan Felsner, Tamás Mészáros 0001, Piotr Micek. Boolean Dimension and Tree-Width
679 -- 690Stefan Glock, Felix Joos, Daniela Kühn, Deryk Osthus. Euler Tours in Hypergraphs
691 -- 720Christian Lindorfer, Wolfgang Woess. The Language of Self-Avoiding Walks
721 -- 748Orit E. Raz, Zvi Shem-Tov. Expanding Polynomials: A Generalization of the Elekes-Rónyai Theorem to d Variables
749 -- 757Misha Rudnev. 2

Volume 40, Issue 4

455 -- 471Grigoriy Blekherman, Annie Raymond, Mohit Singh, Rekha R. Thomas. Simple Graph Density Inequalities with No Sum of Squares Proofs
473 -- 509Michael Chapman, Nati Linial, Yuval Peled. Expander Graphs - Both Local and Global
511 -- 526Alexander Clifton, Hao Huang. On Almost k-Covers of Hypercubes
527 -- 537Andreas F. Holmsen. Large Cliques in Hypergraphs with Forbidden Substructures
539 -- 573Karthik C. S., Pasin Manurangsi. On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
575 -- 599Paul D. Seymour, Sophie Spirkl. Short Directed Cycles in Bipartite Digraphs
601 -- 604Alexander F. Sidorenko. Weakly Norming Graphs are Edge-Transitive

Volume 40, Issue 3

307 -- 314Anurag Bishnoi, Ferdinand Ihringer, Valentina Pepe. A Construction for Clique-Free Pseudorandom Graphs
315 -- 344Asaf Ferber, Vishesh Jain, Benny Sudakov. Number of 1-Factorizations of Regular High-Degree Graphs
345 -- 362Alexander L. Gavrilyuk, Sho Suda, Janos Vidali. On Tight 4-Designs in Hamming Association Schemes
363 -- 403Stefan Glock, Daniela Kühn, Allan Lo, Deryk Osthus. On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems
405 -- 433Ervin Györi, Michael D. Plummer, Dong Ye 0002, Xiaoya Zha. Cycle Traversability for Claw-Free Graphs and Polyhedral Maps
435 -- 454Gergely Harcos, Daniel Soltész. New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs

Volume 40, Issue 1

1 -- 37Robert Connelly, Steven J. Gortler, Louis Theran. Generically Globally Rigid Graphs Have Generic Universally Rigid Frameworks
39 -- 62Oliver Ebsen, Mathias Schacht. Homomorphism Thresholds for Odd Cycles
63 -- 103He Guo, Lutz Warnke. Packing Nearly Optimal Ramsey R(3, t) Graphs
105 -- 147Jie Ma, Bo Ning 0001. Stability Results on the Circumference of a Graph
149 -- 178Noga Alon, Mrinal Kumar, Ben lee Volk. Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits
179 -- 235Peter J. Ayre, Amin Coja-Oghlan, Pu Gao, Noëla Müller. The Satisfiability Threshold For Random Linear Equations
237 -- 244John Chiarelli, Pooya Hatami, Michael E. Saks. An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean function
245 -- 281Tali Kaufman, Izhar Oppenheim. High Order Random Walks: Beyond Spectral Gap
283 -- 305Matthew Kwan, Shoham Letzter, Benny Sudakov, Tuan Tran. Dense Induced Bipartite Subgraphs in Triangle-Free Graphs