Norbert Sauer

According to our database1, Norbert Sauer authored at least 53 papers between 1972 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Permutations avoiding connected graphs.
Contributions to Discrete Mathematics, 2017

2016
Rainbow Ramsey simple structures.
Discrete Mathematics, 2016

2014
Pairs of orthogonal countable ordinals.
Discrete Mathematics, 2014

2013
The Chromatic Number of the Two-Packing of a Forest.
Proceedings of the Mathematics of Paul Erdős II, 2013

2012
Vertex partitions of metric spaces with finite distance sets.
Discrete Mathematics, 2012

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

Partitions and indivisibility properties of countable dimensional vector spaces.
J. Comb. Theory, Ser. A, 2011

The quasi order of graphs on an ordinal.
Discrete Mathematics, 2011

On the General Coloring Problem.
Proceedings of the Rainbow of Computer Science, 2011

2010
Some weak indivisibility results in ultrahomogeneous metric spaces.
Eur. J. Comb., 2010

Distinguishing Number of Countable Homogeneous Relational Structures.
Electr. J. Comb., 2010

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

2009
Representation of ideals of relational structures.
Discrete Mathematics, 2009

2007
Divisibility of countable metric spaces.
Eur. J. Comb., 2007

2006
From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets.
Electr. J. Comb., 2006

Coloring Subgraphs of the Rado Graph.
Combinatorica, 2006

Canonical Partitions Of Universal Structures.
Combinatorica, 2006

2005
Indivisible homogeneous directed graphs and a game for vertex partitions.
Discrete Mathematics, 2005

Chromatic numbers and products.
Discrete Mathematics, 2005

2003
Canonical Vertex Partitions.
Combinatorics, Probability & Computing, 2003

2002
Heyting Algebras and Formal Languages.
J. UCS, 2002

A Ramsey theorem for countable homogeneous directed graphs.
Discrete Mathematics, 2002

On cop-win graphs.
Discrete Mathematics, 2002

Homomorphisms of Products of Graphs into Graphs Without Four Cycles.
Combinatorica, 2002

2001
Atoms and partial orders of infinite languages.
ITA, 2001

Hedetniemi's conjecture -- a survey.
Discrete Mathematics, 2001

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

2000
Jump-number of Means on Graphs.
Eur. J. Comb., 2000

1998
Edge partitions of the countable triangle free homogeneous graph.
Discrete Mathematics, 1998

1997
Chromatic Ramsey Theory.
Eur. J. Comb., 1997

1996
Packing of three copies of a graph.
Journal of Graph Theory, 1996

Lattices arising in categorial investigations of Hedetniemi's conjecture.
Discrete Mathematics, 1996

Edge Partitions of the Rado Graph.
Combinatorica, 1996

The chromatic number of the union of two forests.
Ars Comb., 1996

1995
Ramsey Families which Exclude a Graph.
Combinatorica, 1995

1994
Set-Homogeneous Graphs.
J. Comb. Theory, Ser. B, 1994

On the Divisibility of Homogeneous Hypergraphs.
Combinatorica, 1994

1993
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs.
J. Comb. Theory, Ser. B, 1993

Packing Three Copies of a Tree into a Complete Graph.
Eur. J. Comb., 1993

Cut-sets in infinite graphs and partial orders.
Discrete Mathematics, 1993

Inexhaustible homogeneous structures.
Discrete Mathematics, 1993

1992
An approach to hedetniemi's conjecture.
Journal of Graph Theory, 1992

1991
Two-colouring all two-element maximal antichains.
J. Comb. Theory, Ser. A, 1991

Ramsey-type properties of relational structures.
Discrete Mathematics, 1991

1989
The indivisibility of the homogeneous Kn-free graphs.
J. Comb. Theory, Ser. B, 1989

1986
Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets.
Discrete Mathematics, 1986

On Ramsey-Turán type problems in tournaments.
Discrete Mathematics, 1986

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

1982
On monochromatic paths in edge-coloured digraphs.
J. Comb. Theory, Ser. B, 1982

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

1978
Edge disjoint placement of graphs.
J. Comb. Theory, Ser. B, 1978

1972
On the Density of Families of Sets.
J. Comb. Theory, Ser. A, 1972

Intersection Theorems for Systems of Sets.
J. Comb. Theory, Ser. A, 1972


  Loading...