Hans-Dietrich O. F. Gronau

Roger Labahn

Van Bang Le

Florian Pfender

Discret. Appl. Math., 2014

2013

Completely separating systems of k-sets for (k-12) ≤ n < (k2) or 11 ≤ k ≤ 12.

[BibT_eX]

[DOI]

Ian T. Roberts

Sue D'Arcy

Australas. J Comb., 2013

2009

Orthogonal covers by multiplication graphs.

[BibT_eX]

[DOI]

Markus Schmidmeier

Discret. Appl. Math., 2009

Preface.

[BibT_eX]

[DOI]

Andreas Brandstädt

Van Bang Le

Discret. Appl. Math., 2009

2005

Some Ramsey Schur Numbers.

[BibT_eX]

[DOI]

Jens-P. Bode

Heiko Harborth

Comb. Probab. Comput., 2005

2004

Super-simple (v, 5, 2)-designs.

[BibT_eX]

[DOI]

Donald L. Kreher

Alan C. H. Ling

Discret. Appl. Math., 2004

Orthogonal double covers of Kn, n by small graphs.

[BibT_eX]

[DOI]

Ramadan A. El-Shanawany

Martin Grüttmüller

Discret. Appl. Math., 2004

Preface: ODSA.

[BibT_eX]

[DOI]

Andreas Brandstädt

Roger Labahn

Discret. Appl. Math., 2004

2002

On Orthogonal Double Covers of Graphs.

[BibT_eX]

Des. Codes Cryptogr., 2002

2000

Symmetric Graph Designs.

[BibT_eX]

[DOI]

Alexander Rosa

Paul J. Schellenberg

Graphs Comb., 2000

1999

The Automorphism Group of the Subsequence Poset Bm, n.

[BibT_eX]

[DOI]

Gustav Burosch

Jean-Marie Laborde

Order, 1999

1997

Orthogonal Double Covers of Complete Graphs by Trees.

[BibT_eX]

[DOI]

Alexander Rosa

Graphs Comb., 1997

1996

On posets of m-ary words.

[BibT_eX]

[DOI]

Gustav Burosch

Jean-Marie Laborde

Ingo Warnke

Discret. Math., 1996

1995

On a Problem of Hering Concerning Orthogonal Covers of Kn.

[BibT_eX]

Andrew Granville

J. Comb. Theory, Ser. A, 1995

The closure of all subsets of {3, 4, ...10} which include 3.

[BibT_eX]

Ch. Pietsch

Ars Comb., 1995

1994

Ramsey numbers for sets of small graphs.

[BibT_eX]

[DOI]

Holger Brandes

Heiko Harborth

Christian Schwahn

Discret. Math., 1994

1991

Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions.

[BibT_eX]

[DOI]

Bernhard Ganter

Discret. Math., 1991

1987

Efficient Algorithmic Construction of Designs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1987

1986

An extremal coloring problem on matrices.

[BibT_eX]

[DOI]

Roger Labahn

Discret. Math., 1986

An Erdős-Ko-Rado Type Theorem II.

[BibT_eX]

[DOI]

Acta Cybern., 1986

1985

An intersection-union theorem for integer sequences.

[BibT_eX]

[DOI]

Discret. Math., 1985

1983

More on the Erdös-Ko-Rado Theorem for Integer Sequences.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1983

Maximum Nontrivial k-uniform Set Families in Which no µ Sets Have an Empty Intersection.

[BibT_eX]

J. Inf. Process. Cybern., 1983

1982

On Sperner families in which no k sets have an empty intersection III.

[BibT_eX]

[DOI]

Comb., 1982

Maximal families of restricted subsets of a finite set.

[BibT_eX]

[DOI]

Chr. Proske

Acta Cybern., 1982

1981

On Sperner Families in Which No k Sets Have an Empty Intersection, II.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1981

Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I.

[BibT_eX]

[DOI]

Discret. Math., 1981

On maximal families of subsets of a finite set.

[BibT_eX]

[DOI]

Discret. Math., 1981

On maximal antichains containing no set and its complement.

[BibT_eX]

[DOI]

G. F. Clements

Discret. Math., 1981

1980

On Maximal Antichains Consisting of Sets and Their Complements.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1980

On Sperner Families in which No K Sets Have an Empty Intersection.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1980

1979

Recognition of monotone functions.

[BibT_eX]

[DOI]

Acta Cybern., 1979

On Sperner families in which no 3 sets have an empty intersection.

[BibT_eX]

[DOI]