default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 3
Volume 3, Number 1, 1983
- Miklós Ajtai, János Komlós, Endre Szemerédi:
Sorting in c log n parallel sets. 1-19 - H. Bauer, Bernhard Ganter, Ferdinand Hergert:
Algebraic techniques for nonlinear codes. 21-33 - Gérard Cornuéjols, William R. Pulleyblank:
Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem. 35-52 - William H. Cunningham:
Decompostiton of submodular functions. 53-68 - Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi:
More results on Ramsey - Turán Type problems. 69-81 - Ralph J. Faudree, Miklós Simonovits:
On a class of degenerate extremal graph problems. 83-93 - Péter Hajnal
:
Partition of graphs with condition on the connectivity and minimum degree. 95-99 - Nathan Linial, Michael E. Saks, Vera T. Sós:
Largest digraphs contained in all n-tournaments. 101-104 - László Lovász:
Ear-decompositions of matching covered graphs. 105-117 - Svatopluk Poljak, Miroslav Sura:
On periodical behavior in societies with symmetric influences. 119-121 - Eli Shamir:
How many random edges make a graph Hamiltonian?. 123-131 - Carsten Thomassen:
Cycles in graphs of uncountable chromatic number. 133-134 - Peter M. Winkler:
Proof of the squashed cube conjecture. 135-139
Volume 3, Number 2, 1983
- Richard P. Anstee:
Hypergraphs with no special cycles. 141-146 - Eiichi Bannai, Etsuko Bannai, Dennis Stanton:
An upper bound for the cardinality of an s-distance subset in real Euclidean space, II. 147-152 - Norman Biggs, M. L. Hoare:
The sextet construction for cubic graphs. 153-165 - Fan R. K. Chung, Paul Erdös:
On unavoidable graphs. 167-176 - János Demetrovics, Gy. Gyepesi:
A note on minimal matrix representation of closure operations. 177-179 - Paul Erdös, Miklós Simonovits:
Supersaturated graphs and hypergraphs. 181-192 - Peter Frankl:
An extremal set theoretical characterization of some Steiner systems. 193-199 - Mikio Kano:
Cycle games and cycle cut games. 201-206 - M. V. Lomonosov:
On the planar integer two-flow problem. 207-218 - Arnold Neumaier, J. J. Seidel:
Discrete hyperbolic geometry. 219-237 - Joel Spencer:
What's not inside a Cayley graph. 239-241
Volume 3, Number 3 - 4, 1983
- Richard Rado:
Paul Erdös is seventy years old. 243-244 - Ernst G. Straus:
Paul Erdös at 70. 245-246 - József Beck:
On the lattice property of the plane and some problems of Dirac, Motzkn and Erdös in combinatorial geometry. 281-297 - József Beck, Joel Spencer:
Balancing matrices with line shifts. 299-304 - Ralf Bicker, Bernd Voigt:
Density theorems for finitistic trees. 305-313 - Fan R. K. Chung, Ronald L. Graham:
Edge-colored complete graphs with precisely colored subgraphs. 315-324 - Vasek Chvátal:
Mastermind. 325-329 - Michel Deza, Peter Frankl, N. M. Singhi:
On Functions of Strenth t. 331-339 - Peter Frankl, Zoltán Füredi:
A new generation of the Erdös - Ko - Rado theorem. 341-350 - András Gyárfás, Jenö Lehel:
Hypergraph families with bounded edge cover or transversal number. 351-358 - Bernhard Korte, László Lovász:
Structural properties of greedoids. 359-374 - Alexander Schrijver:
Bounds on the number of Eulerian orientations. 375-380 - Endre Szemerédi, William T. Trotter:
Extremal problems in discrete geometry. 381-392 - Carsten Thomassen:
Disjoint cycles in digraphs. 393-396
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-10-31 20:18 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:
