Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Norbert Sauer
Norbert W. Sauer
2010 – today
- 2012
[j48]Norbert W. Sauer: Vertex partitions of metric spaces with finite distance sets. Discrete Mathematics 312(1): 119-128 (2012)- 2011
- [j47]Péter Komjáth, Jean A. Larson, Norbert Sauer: The quasi order of graphs on an ordinal. Discrete Mathematics 311(15): 1451-1460 (2011)
- [j46]Claude Laflamme, Lionel Nguyen Van Thé, Maurice Pouzet, Norbert W. Sauer: Partitions and indivisibility properties of countable dimensional vector spaces. J. Comb. Theory, Ser. A 118(1): 67-77 (2011)
- [j45]Norbert Sauer, Imed Zaguia: The Order on the Rationals has an Orthogonal Order with the Same Order Type. Order 28(3): 377-385 (2011)
- [c1]
- 2010
- [j44]Claude Laflamme, Lionel Nguyen Van Thé, Norbert W. Sauer: Partition properties of the dense local order and a colored version of Milliken's theorem. Combinatorica 30(1): 83-104 (2010)
- [j43]Claude Laflamme, Lionel Nguyen Van Thé, Norbert Sauer: Distinguishing Number of Countable Homogeneous Relational Structures. Electr. J. Comb. 17(1) (2010)
- [j42]Lionel Nguyen Van Thé, Norbert W. Sauer: Some weak indivisibility results in ultrahomogeneous metric spaces. Eur. J. Comb. 31(5): 1464-1483 (2010)
2000 – 2009
- 2009
- [j41]Christian Delhommé, Maurice Pouzet, Gábor Sági, Norbert Sauer: Representation of ideals of relational structures. Discrete Mathematics 309(6): 1374-1384 (2009)
- 2007
- [j40]Christian Delhommé, Claude Laflamme, Maurice Pouzet, Norbert Sauer: Divisibility of countable metric spaces. Eur. J. Comb. 28(6): 1746-1769 (2007)
- 2006
- [j39]Claude Laflamme, Norbert W. Sauer, Vojkan Vuksanovic: Canonical Partitions Of Universal Structures. Combinatorica 26(2): 183-205 (2006)
- [j38]
- [j37]Maurice Pouzet, Norbert Sauer: From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets. Electr. J. Comb. 13(1) (2006)
- 2005
- [j36]Mohamed M. El-Zahar, Norbert Sauer: Indivisible homogeneous directed graphs and a game for vertex partitions. Discrete Mathematics 291(1-3): 99-113 (2005)
- [j35]Dwight Duffus, Norbert W. Sauer: Chromatic numbers and products. Discrete Mathematics 300(1-3): 91-99 (2005)
- 2003
- [j34]Norbert W. Sauer: Canonical Vertex Partitions. Combinatorics, Probability & Computing 12(5-6): 671-704 (2003)
- 2002
- [j33]Christian Delhommé, Norbert Sauer: Homomorphisms of Products of Graphs into Graphs Without Four Cycles. Combinatorica 22(1): 35-46 (2002)
- [j32]Norbert W. Sauer: A Ramsey theorem for countable homogeneous directed graphs. Discrete Mathematics 253(1-3): 45-61 (2002)
- [j31]Gena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow: On cop-win graphs. Discrete Mathematics 258(1-3): 27-41 (2002)
- [j30]Werner Kuich, Norbert Sauer, Friedrich J. Urbanek: Heyting Algebras and Formal Languages. J. UCS 8(7): 722- (2002)
- 2001
- [j29]Norbert Sauer: Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph. Combinatorica 21(2): 293-308 (2001)
- [j28]
- [j27]Werner Kuich, Norbert Sauer: Atoms and partial orders of infinite languages. ITA 35(4): 389-401 (2001)
- 2000
- [j26]Christian Delhommé, Maurice Pouzet, Norbert Sauer: Jump-number of Means on Graphs. Eur. J. Comb. 21(6): 767-775 (2000)
1990 – 1999
- 1998
- [j25]Norbert Sauer: Edge partitions of the countable triangle free homogeneous graph. Discrete Mathematics 185(1-3): 137-181 (1998)
- 1997
- [j24]Norbert Sauer, Robert E. Woodrow, Vojtech Rödl: Chromatic Ramsey Theory. Eur. J. Comb. 18(1): 93-102 (1997)
- 1996
- [j23]
- [j22]Maurice Pouzet, Norbert Sauer: Edge Partitions of the Rado Graph. Combinatorica 16(4): 505-520 (1996)
- [j21]Dwight Duffus, Norbert Sauer: Lattices arising in categorial investigations of Hedetniemi's conjecture. Discrete Mathematics 152(1-3): 125-139 (1996)
- [j20]Hong Wang, Norbert Sauer: Packing of three copies of a graph. Journal of Graph Theory 21(1): 71-80 (1996)
- 1995
- [j19]Vojtech Rödl, Norbert Sauer, Xu-Ding Zhu: Ramsey Families which Exclude a Graph. Combinatorica 15(4): 589-596 (1995)
- 1994
- [j18]Mohamed M. El-Zahar, Norbert Sauer: On the Divisibility of Homogeneous Hypergraphs. Combinatorica 14(2): 159-165 (1994)
- [j17]Manfred Droste, Dugald Macpherson, Norbert Sauer, Michèle Giraudet: Set-Homogeneous Graphs. J. Comb. Theory, Ser. B 62(1): 63-95 (1994)
- 1993
- [j16]Károly Böröczky, Norbert Sauer, X. Zhu: Inexhaustible homogeneous structures. Discrete Mathematics 115(1-3): 57-63 (1993)
- [j15]András Hajnal, Norbert Sauer: Cut-sets in infinite graphs and partial orders. Discrete Mathematics 117(1-3): 113-125 (1993)
- [j14]Hong Wang, Norbert Sauer: Packing Three Copies of a Tree into a Complete Graph. Eur. J. Comb. 14(2): 137-142 (1993)
- [j13]David S. Gunderson, Vojtech Rödl, Norbert W. Sauer: Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs. J. Comb. Theory, Ser. B 59(2): 199-209 (1993)
- 1992
- [j12]Norbert W. Sauer, X. Zhu: An approach to hedetniemi's conjecture. Journal of Graph Theory 16(5): 423-436 (1992)
- 1991
- [j11]Mohamed M. El-Zahar, Norbert W. Sauer: Ramsey-type properties of relational structures. Discrete Mathematics 94(1): 1-10 (1991)
- [j10]Dwight Duffus, Bill Sands, Norbert Sauer, Robert E. Woodrow: Two-colouring all two-element maximal antichains. J. Comb. Theory, Ser. A 57(1): 109-116 (1991)
1980 – 1989
- 1989
- [j9]Mohamed M. El-Zahar, Norbert Sauer: The indivisibility of the homogeneous Kn-free graphs. J. Comb. Theory, Ser. B 47(2): 162-170 (1989)
- 1986
- [j8]András Hajnal, Norbert Sauer: Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets. Discrete Mathematics 59(1-2): 61-67 (1986)
- [j7]Arie Bialostocki, Norbert Sauer: On Ramsey-Turán type problems in tournaments. Discrete Mathematics 59(3): 221-228 (1986)
- 1985
- [j6]Mohamed M. El-Zahar, Norbert Sauer: The chromatic number of the product of two 4-chromatic graphs is 4. Combinatorica 5(2): 121-126 (1985)
- 1982
- [j5]Bill Sands, Norbert Sauer, Robert E. Woodrow: On monochromatic paths in edge-coloured digraphs. J. Comb. Theory, Ser. B 33(3): 271-275 (1982)
- 1981
- [j4]E. C. Milner, Norbert Sauer: Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma. Discrete Mathematics 35(1-3): 165-171 (1981)
1970 – 1979
- 1978
- [j3]Norbert Sauer, Joel Spencer: Edge disjoint placement of graphs. J. Comb. Theory, Ser. B 25(3): 295-302 (1978)
- 1972
- [j2]H. L. Abbott, Denis Hanson, Norbert Sauer: Intersection Theorems for Systems of Sets. J. Comb. Theory, Ser. A 12(3): 381-389 (1972)
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-07 17:22 CEST by the dblp team