Discrete Mathematics, Volume 108

Volume 108, Numbers 1-3, October 1992

• Jaroslav Nesetril:
  Z. Frolík and his winter schools. 1-2
  Electronic Edition (link) BibTeX
• Bohuslav Balcar, Petr Simon:
  Reaping number and pi-character of Boolean algebras. 5-12
  Electronic Edition (link) BibTeX
• A. Fedeli, Jan Reiterman, A. Tozzi:
  Onw_alpha-compactness. 13-23
  Electronic Edition (link) BibTeX
• Antonio Fernández, Vladimír Müller:
  Embedding of a separable locally pseudoconvex algebra into a locally pseudoconvex algebra with two generators. 25-30
  Electronic Edition (link) BibTeX
• János Gerlits, András Hajnal, Z. Szentmiklóssy:
  On the cardinality of certain Hausdorff spaces. 31-35
  Electronic Edition (link) BibTeX
• Joseph Gil, William L. Steiger, Avi Wigderson:
  Geometric medians. 37-51
  Electronic Edition (link) BibTeX
• Thomas Jech:
  The logarithmic distribution of leading digits and finitely additive measures. 53-57
  Electronic Edition (link) BibTeX
• Igor Kríz:
  All trapezoids are Ramsey. 59-62
  Electronic Edition (link) BibTeX
• Jan Paseka:
  Products in the category of locales: which properties are preserved? 63-73
  Electronic Edition (link) BibTeX
• Jan Pelant, Vojtech Rödl:
  On coverings of infinite- dimentional metric spaces. 75-81
  Electronic Edition (link) BibTeX
• Hans Jürgen Prömel, Bernd Voigt:
  From wqo to bqo, via Ellentuck's theorem. 83-106
  Electronic Edition (link) BibTeX
• Ales Pultr:
  Notes on an extension of the structure of frame. 107-114
  Electronic Edition (link) BibTeX
• Pavel Valtr:
  Sets in R^d with no large empty convex subsets. 115-124
  Electronic Edition (link) BibTeX
• Peter Vojtás:
  Cardinalities of noncentered systems of subsets of omega. 125-129
  Electronic Edition (link) BibTeX
• Jirí Adámek, Jirí Rosický:
  On orthogonal subcategories of locally presentable categories. 133-137
  Electronic Edition (link) BibTeX
• Anders Björner, Johan Karlander:
  Invertibility of the base Radon transform of a matroid. 139-147
  Electronic Edition (link) BibTeX
• Miroslav Fiedler:
  An extremal problem for the spectral radius of a graph. 149-158
  Electronic Edition (link) BibTeX
• Wilfried Imrich, Jaroslav Nesetril:
  Simple tournaments and sharply transitive groups. 159-165
  Electronic Edition (link) BibTeX
• Hiroshi Maehara:
  Extending a flexible unit-bar framework to a rigid one. 167-174
  Electronic Edition (link) BibTeX
• Vlastimil Pták:
  Thickness of families of sets and a minimax lemma. 175-181
  Electronic Edition (link) BibTeX
• András Recski:
  Applications of combinatorics to statics - a second survey. 183-188
  Electronic Edition (link) BibTeX
• Jozef Sirán, Martin Skoviera:
  Groups with sign structure and their antiautomorphisms. 189-202
  Electronic Edition (link) BibTeX
• Vera Trnková:
  Endomorphisms of undirected modifications of directed graphs. 203-209
  Electronic Edition (link) BibTeX
• Jirí Vinárek:
  Simultaneous representations of groups. 211-216
  Electronic Edition (link) BibTeX
• Radek Adamec, Martin Klazar, Pavel Valtr:
  Generalized Davenport-Schinzel sequences with linear upper bound. 219-229
  Electronic Edition (link) BibTeX
• Lars Døvling Andersen:
  The strong chromatic index of a cubic graph is at most 10. 231-252
  Electronic Edition (link) BibTeX
• Peter Bugata:
  Trahtenbrot-Zykov problem and NP-completeness. 253-259
  Electronic Edition (link) BibTeX
• Richard A. Duke, Paul Erdös, Vojtech Rödl:
  Cycle-connected graphs. 261-278
  Electronic Edition (link) BibTeX
• Paul Erdös, Tibor Gallai, Zsolt Tuza:
  Covering the cliques of a graph with vertices. 279-289
  Electronic Edition (link) BibTeX
• P. Frankl:
  On cross-intersecting families. 291-295
  Electronic Edition (link) BibTeX
• Pavol Hell, Donald J. Miller:
  Achromatic numbers and graph operations. 297-305
  Electronic Edition (link) BibTeX
• Svante Janson, Jan Kratochvíl:
  Thresholds for classes of intersection graphs. 307-326
  Electronic Edition (link) BibTeX
• Jozef Jirásek:
  Some remarks on Ádám's conjecture for simple directed graphs. 327-332
  Electronic Edition (link) BibTeX
• Martin Loebl:
  Unprovable combinatorial statements. 333-342
  Electronic Edition (link) BibTeX
• Jirí Matousek, Robin Thomas:
  On the complexity of finding iso- and other morphisms for partial k-trees. 343-364
  Electronic Edition (link) BibTeX
• Matthias Middendorf, Frank Pfeiffer:
  The max clique problem in classes of string-graphs. 365-372
  Electronic Edition (link) BibTeX
• Václav Nýdl:
  Finite undirected graphs which are not reconstructible from their large cardinality subgraphs. 373-377
  Electronic Edition (link) BibTeX
• Svatopluk Poljak, Daniel Turzík:
  Max-cut in circulant graphs. 379-392
  Electronic Edition (link) BibTeX
• Alexander A. Razborov:
  The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear. 393-396
  Electronic Edition (link) BibTeX
• Zsolt Tuza:
  Asymptotic growth of sparse saturated structures is locally determined. 397-402
  Electronic Edition (link) BibTeX