Combinatorica, Volume 16
Volume 16, Number 1, 1996
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips: Biased Random Walks. 1-18- James D. Currie: Non-Repetitive Words: Ages and Essences. 19-40
- Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel: Difference Sets and Inverting the Difference Operator. 87-106
- Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak: Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. 107-122
- Jorge L. Ramírez Alfonsín: Complexity of the Frobenius Problem. 143-147
Volume 16, Number 2, 1996
- Ron Aharoni, Ron Holzman, Michael Krivelevich: On a Theorem of Lovász on Covers in tau-Partite Hypergraphs. 149-174
- Collette R. Coullard, Lisa Hellerstein: Independence and Port Oracles for Matroids, with an Application to Computational Learning Theory. 189-208
- G. S. Gasparian: Minimal Imperfect Graphs: A Simple Approach. 209-212
- Gyula Károlyi, Gábor Tardos: On Point Covers of Multiple Intervals and Axis-Parallel Rectangles. 213-222
- Paul D. Seymour: Packing Circuits in Eulerian Digraphs. 223-231
- Zoltán Szigeti: On a Matroid Defined by Ear-Decompositions of Graphs. 233-241
- Michel Talagrand: How Much Are Increasing Sets Positively Correlated? 243-258
- Eberhard Triesch: On the Recognition Complexity of Some Graph Properties. 259-268
- Pavel Valtr: Lines, Line-Point Incidences and Crossing Families in Dense Sets. 269-294
- Van H. Vu: A Strongly Regular N-Full Graph of Small Order. 295-299
Volume 16, Number 3, 1996
- Noga Alon: Bipartite Subgraphs. 301-311
- Mihai Ciucu: A Remark on Sets Having the Steinhaus Property. 321-324
- Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Perfect Matchings in Balanced Hypergraphs. 325-329
- Guoli Ding: Bounding the Number of Circuits of a Graph. 331-341
- Nabil Kahale, Leonard J. Schulman: Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph. 383-397
- Vsevolod F. Lev: Representing Powers of 2 by a Sum of Four Integers. 413-416
- René Peeters: Orthogonal Representations over Finite Fields and the Chromatic Number of Graphs. 417-431
- Akira Saito: Fan-Type Theorem for Path-Connectivity. 433-437
- Satoru Iwata: Principal Structure of Submodular Systems and Hitchcock-Type Independent Flows. 449
Volume 16, Number 4, 1996
- Xiaotie Deng: Distributed Near-Optimal Matching. 453-464
- László Pyber: Dense Graphs and Edge Reconstruction. 521-525
- Pavel Valtr: The Probability that n Random Points in a Triangle Are in Convex Position. 567-573
- Joseph E. Yukich: Worst Case Asymptotics for Some Classical Optimization Problems. 575-586
- Vsevolod F. Lev: Representation of Elements of a Sequence by Sumsets. 587-590
- Kazuo Murota: On Exchange Axioms for Valuated Matroids and Valuated Delta-Matroids. 591-596
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team