Norbert Sauer

45 papers Journal 44
YearRankTypeTitle / Venue / Authors
2022 J jnl
Distinguishing Number of Universal Homogeneous Urysohn Metric Spaces.
Electron. J. Comb.
Anthony Bonato, Claude Laflamme, M. Pawliuk, Norbert Sauer
2021 J jnl
Siblings of an ℵ0-categorical relational structure.
Contributions Discret. Math.
Claude Laflamme, Maurice Pouzet, Norbert Sauer, Robert E. Woodrow
2021 J jnl
The Poset of Copies for Automorphism Groups of Countable Relational Structures.
J. Multiple Valued Log. Soft Comput.
Claude Laflamme, Maurice Pouzet, Norbert Sauer, Robert E. Woodrow
2017 J jnl
Permutations avoiding connected graphs.
Contributions Discret. Math.
Norbert Sauer, Imed Zaguia
2016 J jnl
Rainbow Ramsey simple structures.
Discret. Math.
Natasha Dobrinen, Claude Laflamme, Norbert Sauer
2014 J jnl
Age and weak indivisibility.
Eur. J. Comb.
Norbert Sauer
2014 J jnl
Pairs of orthogonal countable ordinals.
Discret. Math.
Claude Laflamme, Maurice Pouzet, Norbert Sauer, Imed Zaguia
2013 — ch.
The Chromatic Number of the Two-Packing of a Forest.
The Mathematics of Paul Erdős II
Hong Wang, Norbert Sauer
2011 J jnl
The Order on the Rationals has an Orthogonal Order with the Same Order Type.
Order
Norbert Sauer, Imed Zaguia
2011 J jnl
The quasi order of graphs on an ordinal.
Discret. Math.
Péter Komjáth, Jean A. Larson, Norbert Sauer
2010 J jnl
Distinguishing Number of Countable Homogeneous Relational Structures.
Electron. J. Comb.
Claude Laflamme, Lionel Nguyen Van Thé, Norbert Sauer
2009 J jnl
Representation of ideals of relational structures.
Discret. Math.
Christian Delhommé, Maurice Pouzet, Gábor Sági, Norbert Sauer
2007 J jnl
Divisibility of countable metric spaces.
Eur. J. Comb.
Christian Delhommé, Claude Laflamme, Maurice Pouzet, Norbert Sauer
2006 J jnl
From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets.
Electron. J. Comb.
Maurice Pouzet, Norbert Sauer
2005 J jnl
Indivisible homogeneous directed graphs and a game for vertex partitions.
Discret. Math.
Mohamed M. El-Zahar, Norbert Sauer
2002 J jnl
Heyting Algebras and Formal Languages.
J. Univers. Comput. Sci.
Werner Kuich, Norbert Sauer, Friedrich J. Urbanek
2002 J jnl
Homomorphisms of Products of Graphs into Graphs Without Four Cycles.
Comb.
Christian Delhommé, Norbert Sauer
2002 J jnl
On cop-win graphs.
Discret. Math.
Gena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow
2001 J jnl
Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph.
Comb.
Norbert Sauer
2001 J jnl
Atoms and partial orders of infinite languages.
RAIRO Theor. Informatics Appl.
Werner Kuich, Norbert Sauer
2001 J jnl
Hedetniemi's conjecture -- a survey.
Discret. Math.
Norbert Sauer
2000 J jnl
Jump-number of Means on Graphs.
Eur. J. Comb.
Christian Delhommé, Maurice Pouzet, Norbert Sauer
1998 J jnl
Edge partitions of the countable triangle free homogeneous graph.
Discret. Math.
Norbert Sauer
1997 J jnl
Chromatic Ramsey Theory.
Eur. J. Comb.
Norbert Sauer, Robert E. Woodrow, Vojtech Rödl
1996 J jnl
Edge Partitions of the Rado Graph.
Comb.
Maurice Pouzet, Norbert Sauer
1996 J jnl
Lattices arising in categorial investigations of Hedetniemi's conjecture.
Discret. Math.
Dwight Duffus, Norbert Sauer
1996 J jnl
Packing of three copies of a graph.
J. Graph Theory
Hong Wang, Norbert Sauer
1996 J jnl
The chromatic number of the union of two forests.
Ars Comb.
Norbert Sauer, Jozef Sirán
1995 J jnl
Ramsey Families which Exclude a Graph.
Comb.
Vojtech Rödl, Norbert Sauer, Xuding Zhu
1994 J jnl
On the Divisibility of Homogeneous Hypergraphs.
Comb.
Mohamed M. El-Zahar, Norbert Sauer
1994 J jnl
Set-Homogeneous Graphs.
J. Comb. Theory B
Manfred Droste, Dugald Macpherson, Norbert Sauer, Michèle Giraudet
1993 J jnl
Cut-sets in infinite graphs and partial orders.
Discret. Math.
András Hajnal, Norbert Sauer
1993 J jnl
Inexhaustible homogeneous structures.
Discret. Math.
Károly J. Böröczky, Norbert Sauer, X. Zhu
1993 J jnl
Packing Three Copies of a Tree into a Complete Graph.
Eur. J. Comb.
Hong Wang, Norbert Sauer
1991 J jnl
On the Average Volume of Subsets in Euclidean d-Space.
Eur. J. Comb.
János Pach, Norbert Sauer
1991 J jnl
Two-colouring all two-element maximal antichains.
J. Comb. Theory A
Dwight Duffus, Bill Sands, Norbert Sauer, Robert E. Woodrow
1989 J jnl
The indivisibility of the homogeneous
J. Comb. Theory B
Mohamed M. El-Zahar, Norbert Sauer
1986 J jnl
Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets.
Discret. Math.
András Hajnal, Norbert Sauer
1986 J jnl
On Ramsey-Turán type problems in tournaments.
Discret. Math.
Arie Bialostocki, Norbert Sauer
1985 J jnl
The chromatic number of the product of two 4-chromatic graphs is 4.
Comb.
Mohamed M. El-Zahar, Norbert Sauer
1982 J jnl
On monochromatic paths in edge-coloured digraphs.
J. Comb. Theory B
Bill Sands, Norbert Sauer, Robert E. Woodrow
1981 J jnl
Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma.
Discret. Math.
E. C. Milner, Norbert Sauer
1978 J jnl
Edge disjoint placement of graphs.
J. Comb. Theory B
Norbert Sauer, Joel Spencer
1972 J jnl
Intersection Theorems for Systems of Sets.
J. Comb. Theory A
H. L. Abbott, Denis Hanson, Norbert Sauer
1972 J jnl
On the Density of Families of Sets.
J. Comb. Theory A
Norbert Sauer