Norbert Sauer

Imed Zaguia

Contributions Discret. Math., 2017

2016

Rainbow Ramsey simple structures.

[BibT_eX]

[DOI]

Natasha Dobrinen

Discret. Math., 2016

2014

Age and weak indivisibility.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Pairs of orthogonal countable ordinals.

[BibT_eX]

[DOI]

Discret. Math., 2014

2013

The Chromatic Number of the Two-Packing of a Forest.

[BibT_eX]

[DOI]

Hong Wang

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

Vertex partitions of metric spaces with finite distance sets.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

The Order on the Rationals has an Orthogonal Order with the Same Order Type.

[BibT_eX]

[DOI]

Imed Zaguia

Order, 2011

Partitions and indivisibility properties of countable dimensional vector spaces.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2011

The quasi order of graphs on an ordinal.

[BibT_eX]

[DOI]

Péter Komjáth

Jean A. Larson

Discret. Math., 2011

On the General Coloring Problem.

[BibT_eX]

[DOI]

Proceedings of the Rainbow of Computer Science, 2011

2010

Some weak indivisibility results in ultrahomogeneous metric spaces.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

Distinguishing Number of Countable Homogeneous Relational Structures.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

Partition properties of the dense local order and a colored version of Milliken's theorem.

[BibT_eX]

[DOI]

Comb., 2010

2009

Representation of ideals of relational structures.

[BibT_eX]

[DOI]

Discret. Math., 2009

2007

Divisibility of countable metric spaces.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

2006

From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Coloring Subgraphs of the Rado Graph.

[BibT_eX]

[DOI]

Comb., 2006

Canonical Partitions Of Universal Structures.

[BibT_eX]

[DOI]

Vojkan Vuksanovic

Comb., 2006

2005

Indivisible homogeneous directed graphs and a game for vertex partitions.

[BibT_eX]

[DOI]

Discret. Math., 2005

Chromatic numbers and products.

[BibT_eX]

[DOI]

Dwight Duffus

Discret. Math., 2005

2003

Canonical Vertex Partitions.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2003

2002

Heyting Algebras and Formal Languages.

[BibT_eX]

[DOI]

Werner Kuich

Friedrich J. Urbanek

J. Univers. Comput. Sci., 2002

A Ramsey theorem for countable homogeneous directed graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

On cop-win graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Homomorphisms of Products of Graphs into Graphs Without Four Cycles.

[BibT_eX]

[DOI]

Christian Delhommé

Comb., 2002

2001

Atoms and partial orders of infinite languages.

[BibT_eX]

[DOI]

Werner Kuich

RAIRO Theor. Informatics Appl., 2001

Hedetniemi's conjecture -- a survey.

[BibT_eX]

[DOI]

Discret. Math., 2001

Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph.

[BibT_eX]

[DOI]

Comb., 2001

2000

Jump-number of Means on Graphs.

[BibT_eX]

[DOI]

Christian Delhommé

Eur. J. Comb., 2000

1998

Edge partitions of the countable triangle free homogeneous graph.

[BibT_eX]

[DOI]

Discret. Math., 1998

1997

Chromatic Ramsey Theory.

[BibT_eX]

[DOI]

Robert E. Woodrow

Vojtech Rödl

Eur. J. Comb., 1997

1996

Packing of three copies of a graph.

[BibT_eX]

[DOI]

Hong Wang

J. Graph Theory, 1996

Lattices arising in categorial investigations of Hedetniemi's conjecture.

[BibT_eX]

[DOI]

Dwight Duffus

Discret. Math., 1996

Edge Partitions of the Rado Graph.

[BibT_eX]

[DOI]

Comb., 1996

The chromatic number of the union of two forests.

[BibT_eX]

Jozef Sirán

Ars Comb., 1996

1995

Ramsey Families which Exclude a Graph.

[BibT_eX]

[DOI]

Vojtech Rödl

Xuding Zhu

Comb., 1995

1994

Set-Homogeneous Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1994

On the Divisibility of Homogeneous Hypergraphs.

[BibT_eX]

[DOI]

Comb., 1994

1993

Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs.

[BibT_eX]

[DOI]

David S. Gunderson

Vojtech Rödl

J. Comb. Theory, Ser. B, 1993

Packing Three Copies of a Tree into a Complete Graph.

[BibT_eX]

[DOI]

Hong Wang

Eur. J. Comb., 1993

Cut-sets in infinite graphs and partial orders.

[BibT_eX]

[DOI]

András Hajnal

Discret. Math., 1993

Inexhaustible homogeneous structures.

[BibT_eX]

[DOI]

Károly J. Böröczky

X. Zhu

Discret. Math., 1993

1992

An approach to hedetniemi's conjecture.

[BibT_eX]

[DOI]

X. Zhu

J. Graph Theory, 1992

1991

Two-colouring all two-element maximal antichains.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1991

On the Average Volume of Subsets in Euclidean d-Space.

[BibT_eX]

[DOI]

János Pach

Eur. J. Comb., 1991

Ramsey-type properties of relational structures.

[BibT_eX]

[DOI]

Discret. Math., 1991

1989

The indivisibility of the homogeneous Kn-free graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1989

1986

Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets.

[BibT_eX]

[DOI]

András Hajnal

Discret. Math., 1986

On Ramsey-Turán type problems in tournaments.

[BibT_eX]

[DOI]

Arie Bialostocki

Discret. Math., 1986

1985

The chromatic number of the product of two 4-chromatic graphs is 4.

[BibT_eX]

[DOI]

Comb., 1985

1982

On monochromatic paths in edge-coloured digraphs.

[BibT_eX]

[DOI]

Bill Sands

Robert E. Woodrow

J. Comb. Theory, Ser. B, 1982

1981

Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma.

[BibT_eX]

[DOI]

E. C. Milner

Discret. Math., 1981

1978

Edge disjoint placement of graphs.

[BibT_eX]

[DOI]

Joel Spencer

J. Comb. Theory, Ser. B, 1978

1972

On the Density of Families of Sets.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1972

Intersection Theorems for Systems of Sets.

[BibT_eX]

[DOI]

H. L. Abbott

Denis Hanson