Norbert Sauer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 37 from 37

2022

Distinguishing Number of Universal Homogeneous Urysohn Metric SpacesA. Bonato, Claude Laflamme, M. Pawliuk, Norbert Sauer. combinatorics, 29(3), 2022. [doi]

2021

The Poset of Copies for Automorphism Groups of Countable Relational StructuresClaude Laflamme, Maurice Pouzet, Norbert Sauer, Robert E. Woodrow. mvl, 36(4-5):353-381, 2021. [doi]

Siblings of an ℵ0-categorical relational structureClaude Laflamme, Maurice Pouzet, Norbert Sauer, Robert E. Woodrow. cdm, 16(2):90-127, 2021. [doi]

2017

Permutations avoiding connected graphsNorbert Sauer, Imed Zaguia. cdm, 12(2), 2017. [doi]

2016

Rainbow Ramsey simple structuresNatasha Dobrinen, Claude Laflamme, Norbert Sauer. DM, 339(11):2848-2855, 2016. [doi]

2014

Pairs of orthogonal countable ordinalsClaude Laflamme, Maurice Pouzet, Norbert Sauer, Imed Zaguia. DM, 335:35-44, 2014. [doi]

2013

The Chromatic Number of the Two-Packing of a ForestHong Wang 0022, Norbert Sauer. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős II. pages 143-166, Springer, 2013. [doi]

2011

The quasi order of graphs on an ordinalPéter Komjáth, Jean A. Larson, Norbert Sauer. DM, 311(15):1451-1460, 2011. [doi]

The Order on the Rationals has an Orthogonal Order with the Same Order TypeNorbert Sauer, Imed Zaguia. order, 28(3):377-385, 2011. [doi]

2010

Distinguishing Number of Countable Homogeneous Relational StructuresClaude Laflamme, Lionel Nguyen Van Thé, Norbert Sauer. combinatorics, 17(1), 2010. [doi]

2009

Representation of ideals of relational structuresChristian Delhommé, Maurice Pouzet, Gábor Sági, Norbert Sauer. DM, 309(6):1374-1384, 2009. [doi]

2007

Divisibility of countable metric spacesChristian Delhommé, Claude Laflamme, Maurice Pouzet, Norbert Sauer. ejc, 28(6):1746-1769, 2007. [doi]

2006

From Well-Quasi-Ordered Sets to Better-Quasi-Ordered SetsMaurice Pouzet, Norbert Sauer. combinatorics, 13(1), 2006. [doi]

2005

Indivisible homogeneous directed graphs and a game for vertex partitionsMohamed M. El-Zahar, Norbert Sauer. DM, 291(1-3):99-113, 2005. [doi]

2002

Homomorphisms of Products of Graphs into Graphs Without Four CyclesChristian Delhommé, Norbert Sauer. combinatorica, 22(1):35-46, 2002. [doi]

On cop-win graphsGena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow. DM, 258(1-3):27-41, 2002. [doi]

Heyting Algebras and Formal LanguagesWerner Kuich, Norbert Sauer, Friedrich J. Urbanek. jucs, 8(7):722, 2002. [doi]

2001

Atoms and partial orders of infinite languagesWerner Kuich, Norbert Sauer. ita, 35(4):389-401, 2001. [doi]

Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado GraphNorbert Sauer. combinatorica, 21(2):293-308, 2001. [doi]

Hedetniemi s conjecture -- a surveyNorbert Sauer. DM, 229(1-3):261-292, 2001. [doi]

2000

Jump-number of Means on GraphsChristian Delhommé, Maurice Pouzet, Norbert Sauer. ejc, 21(6):767-775, 2000. [doi]

1998

Edge partitions of the countable triangle free homogeneous graphNorbert Sauer. DM, 185(1-3):137-181, 1998. [doi]

1997

Chromatic Ramsey TheoryNorbert Sauer, Robert E. Woodrow, Vojtech Rödl. ejc, 18(1):93-102, 1997. [doi]

1996

Packing of three copies of a graphHong Wang 0022, Norbert Sauer. jgt, 21(1):71-80, 1996. [doi]

Lattices arising in categorial investigations of Hedetniemi s conjectureDwight Duffus, Norbert Sauer. DM, 152(1-3):125-139, 1996. [doi]

Edge Partitions of the Rado GraphMaurice Pouzet, Norbert Sauer. combinatorica, 16(4):505-520, 1996.

The chromatic number of the union of two forestsNorbert Sauer, Jozef Sirán. arscom, 42, 1996.

1995

Ramsey Families which Exclude a GraphVojtech Rödl, Norbert Sauer, Xu-Ding Zhu. combinatorica, 15(4):589-596, 1995.

1994

Set-Homogeneous GraphsManfred Droste, Dugald Macpherson, Norbert Sauer, Michèle Giraudet. JCT, 62(1):63-95, 1994. [doi]

On the Divisibility of Homogeneous HypergraphsMohamed M. El-Zahar, Norbert Sauer. combinatorica, 14(2):159-165, 1994.

1993

Packing Three Copies of a Tree into a Complete GraphHong Wang 0022, Norbert Sauer. ejc, 14(2):137-142, 1993. [doi]

1991

Two-colouring all two-element maximal antichainsDwight Duffus, Bill Sands, Norbert Sauer, Robert E. Woodrow. JCT, 57(1):109-116, 1991. [doi]

1989

The indivisibility of the homogeneous ::::K::::::::::n::::::-free graphsMohamed M. El-Zahar, Norbert Sauer. JCT, 47(2):162-170, 1989. [doi]

1985

The chromatic number of the product of two 4-chromatic graphs is 4Mohamed M. El-Zahar, Norbert Sauer. combinatorica, 5(2):121-126, 1985.

1982

On monochromatic paths in edge-coloured digraphsBill Sands, Norbert Sauer, Robert E. Woodrow. JCT, 33(3):271-275, 1982. [doi]

1978

Edge disjoint placement of graphsNorbert Sauer, Joel Spencer. JCT, 25(3):295-302, 1978. [doi]

1972

On the Density of Families of SetsNorbert Sauer. JCT, 13(1):145-147, 1972.

Sign in or sign up to see more results.

runs on WebDSL