Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 37
Volume 37, Number 1, February 2017
- Karim A. Adiprasito
, Bruno Benedetti:
Subdivisions, shellability, and collapsibility of products. 1-30 - Jeff Cooper, Dhruv Mubayi:
Sparse hypergraphs with low independence number. 31-40 - Jim Geelen, Peter Nelson:
Odd circuits in dense binary matroids. 41-47 - Jan Hladký, Daniel Král', Sergey Norin:
Counting flags in triangle-free digraphs. 49-76 - Henry A. Kierstead, Alexandr V. Kostochka, Elyse Yeager:
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles. 77-86 - Kaushik Majumder:
On the maximum number of points in a maximal intersecting family of finite sets. 87-97 - Rom Pinchasi:
On the perimeter of k pairwise disjoint convex bodies contained in a convex set in the plane. 99-125
Volume 37, Number 2, April 2017
- Karim A. Adiprasito, Arnau Padrol:
The universality theorem for neighborly polytopes. 129-136 - Levent Alpoge:
Square-root cancellation for the signs of Latin squares. 137-142 - Diana Ojeda-Aristizabal:
Finite forms of Gowers' theorem on the oscillation stability of C 0. 143-155 - Eli Berger:
Unfriendly partitions for graphs not containing a subdivision of an infinite clique. 157-166 - Tai Do Duc, Bernhard Schmidt:
Unique differences in symmetric subsets of F P. 167-182 - Matthias Hamann:
The classification of finite and locally finite connected-homogeneous digraphs. 183-222 - Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
The 4/5 upper bound on the game total domination number. 223-251 - Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen:
The complexity of proving that a graph is Ramsey. 253-268 - David Perkinson, Qiaoyu Yang, Kuai Yu:
G-parking functions and tree inversions. 269-282 - Joseph A. Thas, Hendrik Van Maldeghem:
Finite affine planes in projective spaces. 283-311
Volume 37, Number 3, June 2017
- Iskander Aliev, Robert Bassett, Jesús A. De Loera, Quentin Louveaux:
A quantitative Doignon-Bell-Scarf theorem. 313-332 - Itai Benjamini, Hilary K. Finucane, Romain Tessera:
On the scaling limit of finite vertex transitive graphs with large diameter. 333-374 - Mauro Biliotti, Alessandro Montinaro:
On the rigidity of the Figueroa replacement in PG(2, q 3). 375-395 - Pete L. Clark, Aden Forrow, John R. Schmitt:
Warning's Second Theorem with restricted variables. 397-417 - Gil Cohen, Amir Shpilka, Avishay Tal:
On the degree of univariate polynomials over the integers. 419-464 - Natalia Iyudu, Stanislav Shkarin:
Asymptotically optimal k-step nilpotency of quadratic algebras and the Fibonacci numbers. 465-479 - Alexandr V. Kostochka, Benny Sudakov, Jacques Verstraëte:
Cycles in triangle-free graphs of large chromatic number. 481-494 - Lothar Narins, Alexey Pokrovskiy, Tibor Szabó:
Graphs without proper subgraphs of minimum degree 3 and short cycles. 495-519 - Eszter Rozgonyi, Csaba Sándor:
An extension of Nathanson's Theorem on representation functions. 521-537 - Terence Tao, Van Vu:
Random matrices have simple spectrum. 539-553
Volume 37, Number 4, August 2017
- Ron Aharoni, Tomás Kaiser, Shira Zerbib:
Fractional covers and matchings in families of weighted d-intervals. 555-572 - Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person:
Powers of Hamilton cycles in pseudorandom graphs. 573-616 - József Balogh, Neal Bushaw, Maurício Collares Neto, Hong Liu, Robert Morris, Maryam Sharifzadeh:
The typical structure of graphs with no large cliques. 617-632 - Alexander I. Barvinok, Pablo Soberón:
Computing the partition function for graph homomorphisms. 633-650 - Péter L. Erdös, Dömötör Pálvölgyi, Claude Tardif, Gábor Tardos:
Regular families of forests, antichains and duality pairs of relational structures. 651-672 - Daniel Horsley:
Generalising Fisher's inequality to coverings and packings. 673-696 - Michael Krivelevich, Choongbum Lee, Benny Sudakov:
Compatible Hamilton cycles in Dirac graphs. 697-732 - Anton Malyshev, Igor Pak:
Lifts, derandomization, and diameters of Schreier graphs of Mealy automata. 733-765 - Vojtech Rödl, Andrzej Rucinski, Mathias Schacht:
An exponential-type upper bound for Folkman numbers. 767-784 - Carsten Thomassen:
Infinitely connected subgraphs in graphs of uncountable chromatic number. 785-793
Volume 37, Number 5, October 2017
- Aart Blokhuis, Andries E. Brouwer:
Cocliques in the Kneser graph on line-plane flags in PG(4;q). 795-804 - Eda Cesaratto, Guillermo Matera, Mariana Pérez:
The distribution of factorization patterns on linear families of polynomials over a finite field. 805-836 - Daniel W. Cranston, Landon Rabern:
The fractional chromatic number of the plane. 837-861 - Zdenek Dvorák, Luke Postle:
Density of 5/2-critical graphs. 863-886 - Herbert Edelsbrunner, Alexey A. Glazyrin, Oleg R. Musin, Anton V. Nikitenko:
The Voronoi functional is maximized by the Delaunay triangulation in the plane. 887-910 - Jacob Fox, László Miklós Lovász:
A tight lower bound for Szemerédi's regularity lemma. 911-951 - Konstantin M. Golubev:
On the chromatic number of a simplicial complex. 953-964 - Mark Jerrum, Kitty Meeks:
The parameterised complexity of counting even and odd induced subgraphs. 965-990 - Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon:
The multiplication table problem for bipartite graphs. 991-1010 - James H. Schmerl:
Chromatic numbers of algebraic hypergraphs. 1011-1026 - Carsten Thomassen:
Nash-Williams' cycle-decomposition theorem. 1027-1037
Volume 37, Number 6, December 2017
- Victor Chepoi:
Distance-Preserving Subgraphs of Johnson Graphs. 1039-1055 - Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced Subgraphs of Graphs with Large Chromatic Number. III. Long Holes. 1057-1072 - Antonio Cossidente, Francesco Pavese:
Subspace Codes in PG(2N - 1, Q). 1073-1095 - Genghua Fan:
Integer 4-Flows and Cycle Covers. 1097-1112 - Ervin Györi, Balázs Keszegh:
On the Number of Edge-Disjoint Triangles in K 4-Free Graphs. 1113-1124 - Hongbi Jiang, Daqing Yang:
Decomposing a Graph into Forests: The Nine Dragon Tree Conjecture is True. 1125-1137 - Tomasz Krawczyk, Bartosz Walczak:
On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations. 1139-1179 - Andrey B. Kupavskii, Alexandr Polyanskii:
Proof of Schur's Conjecture in ℝ D. 1181-1205 - Torsten Mütze, Pascal Su:
Bipartite Kneser Graphs are Hamiltonian. 1207-1219 - Orit E. Raz, Micha Sharir:
The Number of Unit-Area Triangles in the Plane: Theme and Variation. 1221-1240
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-04-25 05:28 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:
