


default search action
Combinatorica, Volume 18
Volume 18, Number 1, 1998
- Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan:

Partitioning Graphs of Bounded Tree-Width. 1-12 - György Elekes:

On Linear Combinatorics II. Structure Theorems via Additive Number Theory. 13-25 - Ehud Friedgut:

Boolean Functions With Low Average Sensitivity Depend On Few Coordinates. 27-35 - Michel X. Goemans, David P. Williamson:

Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs. 37-59 - Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi:

A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations. 61-83 - Jeff Kahn, Yang Yu

:
Log-Concave Functions And Poset Probabilities. 85-99 - Yoshiharu Kohayakawa

, Bernd Kreuter, Angelika Steger:
An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth. 101-120 - Nathan Linial, Ori Sasson:

Non-Expansive Hashing. 121-132 - Pompeo Polito, Olga Polverino:

On Small Blocking Sets. 133-137 - Yonutz Stanchescu:

On the Simplest Inverse Problem for Sums of Sets in Several Dimensions. 139-149 
Volume 18, Number 2, 1998
- Yossi Azar, Rajeev Motwani, Joseph Naor:

Approximating Probability Distributions Using Small Sample Spaces. 151-171 - Jason E. Fulman:

The Combinatorics of Biased Riffle Shuffles. 173-184 - Francisco Javier González Vieli:

A Two-Spheres Problem on Homogeneous Trees. 185-189 - Robert Jajcay:

On a Construction of Infinite Families of Regular Cayley Maps. 191-199 - Jeff Kahn, Jeong Han Kim:

Random Matchings in Regular Graphs. 201-226 - Jack H. Koolen

:
The Distance-regular Graphs with Intersection Number a1!=0 and with an Eigenvalue -1-(b1/2). 227-234 - Alexandr V. Kostochka, Vojtech Rödl:

On Large Systems of Sets with No Large Weak <Delta>-subsystems. 235-240 - Michael Molloy, Bruce A. Reed:

A Bound on the Total Chromatic Number. 241-280 - Rudi Pendavingh:

On the Relation Between Two Minor-Monotone Graph Parameters. 281-292 
- Dhruv Mubayi:

Edge-Coloring Cliques with Three Colors on All 4-Cliques. 293-296 - Raimund Seidel:

On the Number of Triangulations of Planar Point Sets. 297-299 
Volume 18, Number 3, 1998
- Noga Alon:

The Shannon Capacity of a Union. 301-310 - Andrew Beveridge, Alan M. Frieze

, Colin McDiarmid:
Random Minimum Length Spanning Trees in Regular Graphs. 311-333 - Ilijas Farah

:
Approximate Homomorphisms. 335-348 - Bernd Gärtner, Martin Henk, Günter M. Ziegler

:
Randomized Simplex Algorithms on Klee-Minty Cubes. 349-372 - Yoshiharu Kohayakawa, Hans Jürgen Prömel, Vojtech Rödl:

Induced Ramsey Numbers. 373-404 - Wolfgang Mader:

Topological Subgraphs in Graphs of Large Girth. 405-412 - Mariusz Meszka, Zdzislaw Skupien:

Self-Converse and Oriented Graphs among the Third Parts of Nearly Complete Digraphs. 413-424 - Gerald W. Schuster:

A Minimum Degree Result for Disjoint Cycles and Forests in Graphs. 425-436 - Yugen Takegahara:

On Butler's Unimodality Result. 437-439 - Hong Wang:

Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three. 441-447 
Volume 18, Number 4, 1998
- Yuri F. Bilu:

Sum-Free Sets and Related Sets. 449-459 - André Bouchet, William H. Cunningham, James F. Geelen:

Principally Unimodular Skew-Symmetric Matrices. 461-486 - Hikoe Enomoto:

On the Existence of Disjoint Cycles in a Graph. 487-492 - Paul Erdös, András Gyárfás, Miklós Ruszinkó:

How to decrease the diameter of triangle-free graphs. 493-501 - Greg N. Frederickson, Roberto Solis-Oba:

Algorithms for Measuring Perturbability in Matroid Optimization. 503-518 - Weidong Gao, Alfred Geroldinger:

On the Structure of Zerofree Sequences. 519-527 - Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:

On Subsets with Small Product in Torsion-Free Groups. 529-540 - Takayuki Hibi:

The Comparability Graph of a Modular Lattice. 541-548 - Alexander V. Karzanov:

A Combinatorial Algorithm for the Minimum (2, r )-Metric Problem and Some Generalizations. 549-568 - Wolfgang Mader:

3n - 5 Edges Do Force a Subdivision of K5. 569-595 

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














