default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 44
Volume 44, Number 1, February 2024
- Marcin Brianski, James Davies, Bartosz Walczak:
Separating Polynomial χ-Boundedness from χ-Boundedness. 1-8 - Konstantin E. Tikhomirov:
On Bounded Degree Graphs with Large Size-Ramsey Numbers. 9-14 - Peter Frankl:
On the Maximum of the Sum of the Sizes of Non-trivial Cross-Intersecting Families. 15-35 - António Girão, Freddie Illingworth
, Emil Powierski, Michael Savery, Alex Scott, Youri Tamitegama, Jane Tan:
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number. 37-62 - Arnau Padrol, Eva Philippe:
Sweeps, Polytopes, Oriented Matroids, and Allowable Graphs of Permutations. 63-123 - Daniel W. Cranston, Reem Mahmoud:
Kempe Equivalent List Colorings. 125-153 - Sam Mansfield, Jonathan Passant:
A Structural Theorem for Sets with Few Triangles. 155-178 - Yuxuan Li, Binzhou Xia, Sanming Zhou, Wenying Zhu:
A Solution to Babai's Problems on Digraphs with Non-diagonalizable Adjacency Matrix. 179-203 - Torsten Mütze:
A Book Proof of the Middle Levels Theorem. 205-208 - Florian Lehner:
Universal Planar Graphs for the Topological Minor Relation. 209-230
Volume 44, Number 2, April 2024
- Lukas Kölsch, Alexandr Polujan:
Value Distributions of Perfect Nonlinear Functions. 231-268 - Benjamin Bedert:
On Unique Sums in Abelian Groups. 269-298 - Arturas Dubickas:
An Upper Bound for the Height of a Tree with a Given Eigenvalue. 299-310 - Jan Corsten, Walner Mendonça:
Tiling Edge-Coloured Graphs with Few Monochromatic Bounded-Degree Graphs. 311-335 - Nguyên Công Minh, Thanh Vu:
A Characterization of Graphs Whose Small Powers of Their Edge Ideals Have a Linear Free Resolution. 337-353 - Anneleen De Schepper, Jeroen Schillewaert, Hendrik Van Maldeghem:
On the Generating Rank and Embedding Rank of the Hexagonic Lie Incidence Geometries. 355-392 - Tao Zhang:
A Group Ring Approach to Fuglede's Conjecture in Cyclic Groups. 393-416 - Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. 417-427 - Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf:
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs. 429-440 - Vuong Bui, Hamid Reza Daneshpajouh:
A Topological Version of Hedetniemi's Conjecture for Equivariant Spaces. 441-452
Volume 44, Number 3, June 2024
- Richard H. Hammack, Paul C. Kainen:
Euler's Theorem for Regular CW-Complexes. 453-465 - Chun-Hung Liu:
Defective Coloring is Perfect for Minors. 467-507 - Lior Gishboliner, Zhihan Jin, Benny Sudakov:
Ramsey Problems for Monotone Paths in Graphs and Hypergraphs. 509-529 - Colin Defant, Noah Kravitz, Nathan Williams:
The Ungar Games. 531-561 - Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha:
Boolean Function Analysis on High-Dimensional Expanders. 563-620 - Carolina Benedetti-Velásquez, Kolja Knauer:
Lattice Path Matroids and Quotients. 621-650 - Thilo Krill, Max Pitz:
The Number of Topological Types of Trees. 651-657 - Eli Berger, Paul D. Seymour:
Bounded-Diameter Tree-Decompositions. 659-674 - António Girão, Freddie Illingworth, Lukas Michel, Michael Savery, Alex D. Scott:
Flashes and Rainbows in Tournaments. 675-690 - Christian Reiher, Tomasz Schoen:
Note on the Theorem of Balog, Szemerédi, and Gowers. 691-698
Volume 44, Number 4, August 2024
- Shirshendu Ganguly, Ella Hiesmayr, Kyeongsik Nam:
Upper Tail Behavior of the Number of Triangles in Random Graphs with Constant Average Degree. 699-740 - Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich:
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs. 741-784 - Oliver Janzer, Benny Sudakov, István Tomon:
Small Subgraphs with Large Average Degree. 785-800 - Gal Yehuda, Amir Yehudayoff:
A Lower Bound for Essential Covers of the Cube. 801-815 - Tibor Jordán, Soma Villányi:
Globally Linked Pairs of Vertices in Generic Frameworks. 817-838 - Oliver Janzer, Cosmin Pohoata:
On the Zarankiewicz Problem for Graphs with Bounded VC-Dimension. 839-848 - Alexandr V. Kostochka, Ruth Luo, Grace McCourt:
A Hypergraph Analog of Dirac's Theorem for Long Cycles in 2-Connected Graphs. 849-880 - Felix Klingelhöfer, Alantha Newman:
Bounding the Chromatic Number of Dense Digraphs by Arc Neighborhoods. 881-895 - Zdenek Dvorák, Carl Feghali:
Solution to a Problem of Grünbaum on the Edge Density of 4-Critical Planar Graphs. 897-907 - Jaehoon Kim, Joonkyung Lee, Hong Liu, Tuan Tran:
Rainbow Cycles in Properly Edge-Colored Graphs. 909-919
Volume 44, Number 5, October 2024
- Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs. 921-948 - József Balogh, Haoran Luo:
Turán Density of Long Tight Cycle Minus One Hyperedge. 949-976 - Victor Falgas-Ravry, Klas Markström, Eero Räty:
Rainbow Variations on a Theme by Mantel: Extremal Problems for Gallai Colouring Templates. 977-1010 - Domagoj Bradac, Nemanja Draganic, Benny Sudakov:
Effective Bounds for Induced Size-Ramsey Numbers of Cycles. 1011-1039 - Tomás Kaiser, Matej Stehlík, Riste Skrekovski:
Criticality in Sperner's Lemma. 1041-1051 - Agnijo Banerjee:
A Proof of a Frankl-Kupavskii Conjecture on Intersecting Families. 1053-1061 - Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
List-k-Coloring H-Free Graphs for All k>4. 1063-1068 - Ahmad Abdi, Gérard Cornuéjols, Giacomo Zambelli:
Arc Connectivity and Submodular Flows in Digraphs. 1069-1090 - Peter Bradshaw, Yaobin Chen, Hao Ma, Bojan Mohar, Hehui Wu:
List-Avoiding Orientations. 1091-1113 - Gwenaël Joret, Clément Rambaud:
Neighborhood Complexity of Planar Graphs. 1115-1148
Volume 44, Number 6, December 2024
- Christopher Cornwell, Nathan McNew:
Links and the Diaconis-Graham Inequality. 1149-1167 - Jim Geelen, Matthew E. Kroeker:
Unavoidable Flats in Matroids Representable over Prime Fields. 1169-1176 - Xueping Huang, Shiping Liu, Qing Xia:
Bounding the Diameter and Eigenvalues of Amply Regular Graphs via Lin-Lu-Yau Curvature. 1177-1192 - Alexander Barg, Moshe Schwartz, Lev Yohananov:
Storage Codes on Coset Graphs with Asymptotically Unit Rate. 1193-1209 - Jaroslav Nesetril, Vojtech Rödl, Marcelo Tadeu Sales:
On Pisier Type Theorems. 1211-1232 - Dong Yeap Kang, Tom Kelly, Daniela Kühn, Deryk Osthus, Vincent Pfenninger:
Perfect Matchings in Random Sparsifications of Dirac Hypergraphs. 1233-1266 - Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure Pairs. VIII. Excluding a Sparse Graph. 1267-1295 - Johannes Carmesin:
A Whitney Type Theorem for Surfaces: Characterising Graphs with Locally Planar Embeddings. 1297-1323 - Robert Connelly, Steven J. Gortler, Louis Theran:
Reconstruction in One Dimension from Unlabeled Euclidean Lengths. 1325-1351 - Saveliy V. Skresanov:
On Directed and Undirected Diameters of Vertex-Transitive Graphs. 1353-1366 - Gabriel Currier, Kenneth Moore, Chi Hoi Yip:
Any Two-Coloring of the Plane Contains Monochromatic 3-Term Arithmetic Progressions. 1367-1380 - Debsoumya Chakraborti, Jaehoon Kim, Hyunwoo Lee, Jaehyeon Seo:
Hamilton Transversals in Tournaments. 1381-1400 - António Girão, Freddie Illingworth, Lukas Michel, Michael Savery, Alex Scott:
Publisher Erratum: Flashes and Rainbows in Tournaments. 1401-1402 - Ahmad Abdi, Gérard Cornuéjols, Giacomo Zambelli:
Erratum to: Arc Connectivity and Submodular Flows in Digraphs. 1403
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-01-07 20:35 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:
