Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 43
Volume 43, Number 1, February 2023
- Simón Piga
, Nicolás Sanhueza-Matamala:
Cycle Decompositions in 3-Uniform Hypergraphs. 1-36 - Julien Bensmail, Hervé Hocquard, Dimitri Lajou, Éric Sopena:
A Proof of the Multiplicative 1-2-3 Conjecture. 37-55 - Tom Kelly, Luke Postle:
On the Density of Critical Graphs with No Large Cliques. 57-89 - Slawomir Solecki:
Dual Ramsey Theorem for Trees. 91-128 - Freddie Illingworth:
Minimum Degree Stability of H-Free Graphs. 129-147 - Assaf Rinot, Jing Zhang:
Strongest Transformations. 149-185 - Jacob Fox, János Pach, Andrew Suk:
Sunflowers in Set Systems of Bounded Dimension. 187-202
Volume 43, Number 2, April 2023
- Zilin Jiang, Jonathan Tidor, Yuan Yao, Shengtong Zhang, Yufei Zhao:
Spherical Two-Distance Sets and Eigenvalues of Signed Graphs. 203-232 - Sean Eberhard:
Hamming Sandwiches. 233-256 - Andries E. Brouwer, Ferdinand Ihringer, William M. Kantor:
Strongly Regular Graphs Satisfying the 4-Vertex Condition. 257-276 - Lukas Kühne:
The Universality of the Resonance Arrangement and Its Betti Numbers. 277-298 - Daniel Glasscock, Joel Moreira, Florian Karl Richter:
A combinatorial proof of a sumset conjecture of Furstenberg. 299-328 - Ilya D. Shkredov:
On an Application of Higher Energies to Sidon Sets. 329-345 - Chaoping Xing, Chen Yuan:
Beating the Probabilistic Lower Bound on q-Perfect Hashing. 347-366 - Evita Nestoridi, Peter Sarnak:
Bounded Cutoff Window for the Non-backtracking Random Walk on Ramanujan Graphs. 367-384 - Isabel Hubard, Elías Mochán, Antonio Montero:
Voltage Operations on Maniplexes, Polytopes and Maps. 385-420 - Ádám Timár:
A Factor Matching of Optimal Tail Between Poisson Processes. 421-427
Volume 43, Number 3, June 2023
- Domagoj Bradac, Lior Gishboliner, Oliver Janzer, Benny Sudakov:
Asymptotics of the Hypergraph Bipartite Turán Problem. 429-446 - Jun Gao, Jie Ma:
Tight Bounds Towards a Conjecture of Gallai. 447-453 - Karthekeyan Chandrasekaran, Chandra Chekuri:
Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions. 455-477 - Matias von Bell, Rafael S. González D'León, Francisco A. Mayorga Cetina, Martha Yip:
A Unifying Framework for the ν-Tamari Lattice and Principal Order Ideals in Young's Lattice. 479-504 - Matija Bucic, Benny Sudakov:
Large Independent Sets from Local Considerations. 505-546 - Richard Lang, Luke Postle:
An Improved Bound for the Linear Arboricity Conjecture. 547-569 - Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure Pairs. V. Excluding Some Long Subdivision. 571-593 - Md Lutfar Rahman, Thomas Watson:
6-Uniform Maker-Breaker Game is PSPACE-Complete. 595-612 - Ron Rosenthal, Lior Tenenbaum:
Simplicial Spanning Trees in Random Steiner Complexes. 613-650 - Ralph Keusch:
Vertex-Coloring Graphs with 4-Edge-Weightings. 651-658
Volume 43, Number 4, August 2023
- Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs Circumference. 659-664 - Asaf Ferber, Liam Hardiman, Adva Mond:
Counting Hamilton Cycles in Dirac Hypergraphs. 665-680 - Giovanni Longobardi, Giuseppe Marino, Rocco Trombetti, Yue Zhou:
A Large Family of Maximum Scattered Linear Sets of ${{\,\mathrm{{PG}}\,}}(1,q^n)$ and Their Associated MRD Codes. 681-716 - Sergey Avvakumov, Roman N. Karasev, Arkadiy Skopenkov:
Stronger Counterexamples to the Topological Tverberg Conjecture. 717-727 - Eric Naslund:
Upper Bounds For Families Without Weak Delta-Systems. 729-735 - Rajko Nenadov:
Routing Permutations on Spectral Expanders via Matchings. 737-742 - David Conlon, Jacob Fox, Yuval Wigderson:
Three Early Problems on Size Ramsey Numbers. 743-768 - Peter J. Bradshaw:
Growth in Sumsets of Higher Convex Functions. 769-789 - Jakub Przybylo, Fan Wei:
On the Asymptotic Confirmation of the Faudree-Lehel Conjecture for General Graphs. 791-826 - Brett Kolesnik:
The Asymptotic Number of Score Sequences. 827-844
Volume 43, Number 5, October 2023
- Alex Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path. 845-852 - He Guo, Kalen Patton, Lutz Warnke:
Prague Dimension of Random Graphs. 853-884 - Bingyu Luan, Yantao Tang, Guanghui Wang, Donglei Yang:
Balanced Subdivisions of Cliques in Graphs. 885-907 - Davi Castro-Silva, Fernando Mário de Oliveira Filho, Lucas Slot, Frank Vallentin:
A Recursive Theta Body for Hypergraphs. 909-938 - Balázs Keszegh, Dömötör Pálvölgyi:
The Number of Tangencies Between Two Families of Curves. 939-952 - Joshua Hinman:
A Positive Answer to Bárány's Question on Face Numbers of Polytopes. 953-962 - Donggyu Kim, Duksang Lee, Sang-il Oum:
Γ-Graphic Delta-Matroids and Their Applications. 963-983 - Minki Kim, Alan Lew:
Leray Numbers of Tolerance Complexes. 985-1006 - Patrick Schnider:
Enclosing Depth and Other Depth Measures. 1007-1029 - Guyslain Naves:
Integer Multiflows in Acyclic Planar Digraphs. 1031-1043
Volume 43, Number 6, December 2023
- József Balogh, Ce Chen, Kevin Hendrey, Ben Lund, Haoran Luo, Casey Tompkins, Tuan Tran:
Maximal 3-Wise Intersecting Families. 1045-1066 - Claude Tardif:
The Chromatic Number of the Product of 5-Chromatic Graphs can be 4. 1067-1073 - Marcelo Tadeu Sales, Bjarne Schülke:
A Local Version of Katona's Intersecting Shadow Theorem. 1075-1080 - Denys Bulavka, Martin Tancer, Mykhaylo Tyomkyn:
Weak Saturation of Multipartite Hypergraphs. 1081-1102 - Daniel McGinnis:
A Necessary and Sufficient Condition for (2d-2)-Transversals in $\mathbb {R}^{2d}$. 1103-1109 - Gaurav Kucheriya, Gábor Tardos:
A Characterization of Edge-Ordered Graphs with Almost Linear Extremal Functions. 1111-1123 - Jun Gao, Hong Liu, Zixiang Xu:
Stability Through Non-Shadows. 1125-1137 - Andrew Granville, George Shakan, Aled Walker:
Effective Results on the Size and Structure of Sumsets. 1139-1178 - David J. Grynkiewicz:
A Generalization of the Chevalley-Warning and Ax-Katz Theorems with a View Towards Combinatorial Number Theory. 1179-1213 - Sebastian Mies, Benjamin Moore:
The Strong Nine Dragon Tree Conjecture is True for $d \le k + 1$. 1215-1239
a service of 
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 2024-05-15 21:32 CEST 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:
