Norbert Sauer

Publication Activity (10 Years)

Years Active: 1972-2022
Publications (10 Years): 5

Top Topics

Highly Reliable

First Order Logic

Top Venues

Contributions Discret. Math.

Electron. J. Comb.

J. Multiple Valued Log. Soft Comput.

Publications

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