Hans-Dietrich O. F. Gronau

发表

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

Donald L. Kreher, Alan C. H. Ling, Hans-Dietrich O. F. Gronau, 2004, Discret. Appl. Math..

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

Ronald C. Mullin, Hans-Dietrich O. F. Gronau, Ch. Pietsch, 1995, Ars Comb..

Some Ramsey Schur Numbers

Hans-Dietrich O. F. Gronau, Heiko Harborth, Jens-P. Bode, 2005, Comb. Probab. Comput..

Maximal families of restricted subsets of a finite set

Hans-Dietrich O. F. Gronau, Chr. Proske, 1982, Acta Cybern..

On posets of m-ary words

Gustav Burosch, Jean-Marie Laborde, Hans-Dietrich O. F. Gronau, 1996, Discret. Math..

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

Hans-Dietrich O. F. Gronau, 1983, J. Inf. Process. Cybern..

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

Bernhard Ganter, Hans-Dietrich O. F. Gronau, B. Ganter, 1991, Discret. Math..

On maximal antichains containing no set and its complement

Hans-Dietrich O. F. Gronau, G. F. Clements, 1981, Discret. Math..

Orthogonal covers by multiplication graphs

Hans-Dietrich O. F. Gronau, Markus Schmidmeier, 2009, Discret. Appl. Math..

The Automorphism Group of the Subsequence Poset Bm, n

Gustav Burosch, Jean-Marie Laborde, Hans-Dietrich O. F. Gronau, 1999, Order.

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

Hans-Dietrich O. F. Gronau, Ian T. Roberts, Sue D'Arcy, 2013, Australas. J Comb..

Recognition of monotone functions

Hans-Dietrich O. F. Gronau, 1979, Acta Cybern..

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

Hans-Dietrich O. F. Gronau, 1983, J. Comb. Theory, Ser. A.

On Orthogonal Double Covers of Graphs

Sven Hartmann, Uwe Leck, Hans-Dietrich O. F. Gronau, 2002, Des. Codes Cryptogr..

Orthogonal Double Covers of Complete Graphs by Trees

Alexander Rosa, Ronald C. Mullin, Hans-Dietrich O. F. Gronau, 1997, Graphs Comb..

On sperner families in which nok sets have an empty intersection III

Hans-Dietrich O. F. Gronau, 1982, Comb..

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

Hans-Dietrich O. F. Gronau, 1981, Discret. Math..

An Erdős-Ko-Rado Type Theorem II

Konrad Engel, Hans-Dietrich O. F. Gronau, 1986, Acta Cybern..

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

Hans-Dietrich O. F. Gronau, 1981, J. Comb. Theory, Ser. A.

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

Hans-Dietrich O. F. Gronau, 1979, Acta Cybern..

Ramsey numbers for sets of small graphs

Hans-Dietrich O. F. Gronau, Heiko Harborth, Christian Schwahn, 1994, Discret. Math..

An intersection-union theorem for integer sequences

Konrad Engel, Hans-Dietrich O. F. Gronau, 1985, Discret. Math..

Preface: ODSA

Konrad Engel, Andreas Brandstädt, Roger Labahn, 2004, Discret. Appl. Math..

Symmetric Graph Designs

Alexander Rosa, Ronald C. Mullin, Paul J. Schellenberg, 2000, Graphs Comb..

Efficient Algorithmic Construction of Designs

Hans-Dietrich O. F. Gronau, 1987, FCT.

On a Problem of Hering Concerning Orthogonal Covers of Kn

Ronald C. Mullin, Hans-Dietrich O. F. Gronau, Andrew Granville, 1995, J. Comb. Theory, Ser. A.

An extremal coloring problem on matrices

Roger Labahn, Hans-Dietrich O. F. Gronau, 1986, Discret. Math..

Two conjectures of Demetrovics, Furedi, and Katona, concerning partitions

Bernhard Ganter, Hans-Dietrich O. F. Gronau, 1991 .

Path systems in acyclic directed graphs

Hans-Dietrich O. F. Gronau, Winfried Just, Wolfgang Schade, 1987 .

On orthogonal double covers of kn and a conjecture of chung and west

Ronald C. Mullin, Paul J. Schellenberg, Hans-Dietrich O. F. Gronau, 1995 .

Sperner theory in partially ordered sets

Konrad Engel, Hans-Dietrich O. F. Gronau, 1985 .

PBDs and GDDs: The Basics

Ronald C. Mullin, Hans-Dietrich O. F. Gronau, 2006 .

Pairwise Balanced Designs

R. Julian R. Abel, Gennian Ge, Ronald C. Mullin, 2006 .