default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 45
Volume 45, Number 1, February 2025
- Tomas Juskevicius, Valentas Kurauskas:
Anticoncentration of Random Vectors via the Strong Perfect Graph Theorem. 1 - Siddharth Bhandari, Abhishek Khetan:
Improved Upper Bound for the Size of a Trifferent Code. 2 - Rafal Kalinowski, Monika Pilsniak, Marcin Stawiski:
Unfriendly Partition Conjecture Holds for Line Graphs. 3 - Antonio Montero, Micael Toledo:
Chiral Extensions of Regular Toroids. 5 - Agelos Georgakopoulos:
The Excluded Minors for Embeddability into a Compact Surface. 6 - Xiao Han:
A New Bound for the Fourier-Entropy-Influence Conjecture. 4 - Lina Li, Gweneth McKinley, Jinyoung Park:
The Number of Colorings of the Middle Layers of the Hamming Cube. 7 - Saba Lepsveridze, Aleksandre Saatashvili, Yufei Zhao:
Uniacute Spherical Codes. 8 - Gal Beniamini, Nir Lavee, Nati Linial:
How Balanced Can Permutations Be? 9 - Claudio Alexandre Piedade
, Philippe Tranchida:
Constructing New Geometries: A Generalized Approach to Halving for Hypertopes. 10
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-02-20 00:47 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:
