default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 36
Volume 36, Number 1, February 2016
- Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka
:
Tight lower bounds for linear 2-query LCCs over finite fields. 1-36 - David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov:
Ramsey numbers of cubes versus cliques. 37-70 - Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris, David Saxton, Jozef Skokan:
On the Ramsey number of the triangle and the cube. 71-89 - Tali Kaufman, Avi Wigderson:
Symmetric LDPC codes and local testing. 91-120 - Tsai-Lien Wong, Xuding Zhu:
Every graph is (2, 3)-choosable. 121-127
Volume 36, Number 2, April 2016
- Ben Green, Robert Morris:
Counting sets with small sumset and applications. 129-159 - Venkatesan Guruswami, Swastik Kopparty:
Explicit subspace designs. 161-185 - Guy Moshkovitz, Asaf Shapira:
A short proof of Gowers' lower bound for the regularity lemma. 187-194 - Ori Parzanchevski, Ron Rosenthal, Ran J. Tessler:
Isoperimetric inequalities in simplicial complexes. 195-227 - Alain Plagne, Anne de Roton:
Maximal sets with no solution to x+y=3z. 229-248
Volume 36, Number 3, June 2016
- Gregory L. Cherlin, Saharon Shelah:
Universal graphs with a forbidden subgraph: Block path solidity. 249-264 - Justin Gilmer, Michael E. Saks, Srikanth Srinivasan:
Composition limits and separating examples for some boolean function complexity measures. 265-311 - Matthias Hamann:
Spanning trees in hyperbolic graphs. 313-332 - Florian Lehner:
Distinguishing graphs with intermediate growth. 333-347 - Adam Sheffer, Joshua Zahl, Frank de Zeeuw:
Few distinct distances implies no heavy lines or circles. 349-364 - Igor Protasov, Sergiy Slobodianiuk:
Note: A conjecture on partitions of groups. 365-369
Volume 36, Number 4, August 2016
- Edward Dobson, Pablo Spiga, Gabriel Verret:
Cayley graphs on abelian groups. 371-393 - Chris D. Godsil, David E. Roberson, Robert Sámal, Simone Severini:
Sabidussi versus Hedetniemi for three variations of the chromatic number. 395-415 - Andreas F. Holmsen, Edgardo Roldán-Pensado:
The colored Hadwiger transversal theorem in ℝ d. 417-429 - Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang:
Tree-width and dimension. 431-450 - Daniela Kühn, Deryk Osthus, Timothy Townsend:
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths. 451-469 - Allan Lo:
Properly coloured Hamiltonian cycles in edge-coloured complete graphs. 471-492
Volume 36, Number 5, October 2016
- Hao Huang, Nati Linial, Humberto Naves, Yuval Peled, Benny Sudakov:
On the densities of cliques and independent sets in graphs. 493-512 - Dieter Jungnickel, Klaus Metsch:
The characterization problem for designs with the parameters of AGd(n, q). 513-535 - Jie Ma, Xingxing Yu:
On judicious bipartitions of graphs. 537-556 - Alexander Stoimenow:
A theorem on graph embedding with a relation to hyperbolic volume. 557-589 - Andreas Thom:
The expected degree of minimal spanning forests. 591-600 - Carsten Thomassen:
Orientations of infinite graphs with prescribed edge-connectivity. 601-621
Volume 36, Number 6, December 2016
- Shagnik Das, Wenying Gan, Benny Sudakov:
The minimum number of disjoint pairs in set systems and related problems. 623-660 - Vida Dujmovic, Gwenaël Joret, Jakub Kozik, David R. Wood:
Nonrepetitive colouring via entropy compression. 661-686 - Michael J. Ferrara, Timothy D. LeSaulnier, Casey Moffatt, Paul S. Wenger:
On the sum necessary to ensure that a degree sequence is potentially H-graphic. 687-702 - Lauren Keough, Andrew John Radcliffe:
Graphs with the fewest matchings. 703-723 - Klaus Metsch:
Small tight sets in finite elliptic, parabolic and Hermitian polar spaces. 725-744
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-11-21 20:32 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:
