Department of Mathematics and Statistics at the Faculty of Science
University of Calgary
Norbert Sauer
- Professor
Office Hours
| Monday | Tuesday | Wednesday | Thursday | Friday | Saturday | Sunday |
|---|---|---|---|---|---|---|
| - | 9:20a‑12p | - | 9:20a‑10:15a | 9a‑11a | - | - |
Research Interests
Currently Teaching
| F2012 - MATH 335 - Analysis I | ||||||||||
| ||||||||||
| F2012 - MATH 355 - Honours Analysis I | ||||||||||
| ||||||||||
| W2013 - MATH 501 - Measure and Integration | ||||||||||
| ||||||||||
| W2013 - MATH 601 - Measure and Integration | ||||||||||
| ||||||||||
| W2013 - PMAT 415 - Set Theory | ||||||||||
| ||||||||||
Publications
Book
- Sauer, Norbert. Coloring finite substructures of countable structures 11. J\'anos Bolyai Math. Soc., 2002. 525-553.
- Wang, Hong and Sauer, Norbert. The chromatic number of the two-packing of a forest 14. Springer, 1997. 99-120.
- Imrich, Wilfried , Sauer, Norbert and Woess, Wolfgang . The average size of nonsingular sets in a graph 411. Kluwer Acad. Publ., 1993. 199-205.
- Sauer, Norbert. Vertex partition problems , J\'anos Bolyai Math. Soc., 1993. 361-377.
- Sauer, Norbert and Zhu, X. . Graphs which do not embed a given graph and the {R}amsey property 60. North-Holland, 1992. 631-636.
- Sauer, Norbert and El-Zahar, M. . Partition theorems for graphs respecting the chromatic number 301. Kluwer Acad. Publ., 1990. 237-242.
- Sauer, Norbert and Stone, Mike . Preemptive scheduling Kluwer Acad. Publ., 1989. 307-323.
- Sauer, Norbert and Stone, Mike . A characterization of extendible lattices H\"older-Pichler-Tempsky, 1988. 243-246.
- Sauer, Norbert and Stone, Mike . Indigenous relations in categories of sets H\"older-Pichler-Tempsky, 1987. 313-320.
- Sauer, Norbert and Stone, Mike . Monoids and their local closures 43. North-Holland, 1986. 455-467.
- Sauer, Norbert and Stone, Mike . Extendible lattices H\"older-Pichler-Tempsky, 1985. 331-334.
- Koh, K. M. and Sauer, Norbert. Concentric subgraphs, closed subsets and dense graphs 1073. Springer, 1984. 100-118.
- Sauer, Norbert, Stone, Mike and Weedmark, R. H.. Every finite algebra with congruence lattice {$M\sb{7}$} has principal congruences 1004. Springer, 1983. 273-292.
- Sauer, Norbert and Stone, Mike . A {G}alois correspondence between algebras and endomorphisms 29. North-Holland, 1982. 691-695.
- Sauer, Norbert. The largest number of edges of a graph such that not more than {$g$}\ intersect in a point or more than {$n$} are independent Academic Press, 1971. 253-257.
- Sauer, Norbert. On the factorization of {$n$}-graphs North-Holland, 1970. 981-995.
- Kuich, W. and Sauer, Norbert. On the existence of certain minimal regular {$n$}-systems with given girth Academic Press, 1969. 93-101.
Conference Proceedings
Journal Paper
- Laflamme, Claude, Nguyen Van Thé, Lionel and Sauer, Norbert. Distinguishing Number of Countable Homogeneous Relational Structures 16(1). 2010.
- Laflamme, Claude, Nguyen Van Thé, Lionel and Sauer, Norbert. Partition properties of the dense local order and a colored version of Milliken's theorem. 30.1 2010. 83-104.
- Delhommé, Christian, Pouzet, Maurice, Sagi, Gabor and Sauer, Norbert. Representation of ideals of relational structures 309.6 2009. 1374-1384.
- Laflamme, Claude, Nguyen Van Thé, Lionel, Pouzet, Maurice and Sauer, Norbert. Partitions and Indivisibility Properties of Countable Dimensional Vector Spaces 118.1 2009. 67-77.
- Nguyen Van Thé, Lionel and Sauer, Norbert. The Urysohn sphere is oscillation stable (to appear)
- Nguyen Van Thé, Lionel and Sauer, Norbert. Some weak indivisibility results in ultrahomogeneous metric spaces 2008.
- Delhomme, Christian, Laflamme, Claude, Pouzet, Maurice and Sauer, Norbert. Divisibility of countable metric spaces 28. 2007. 1746-1749.
- Sauer, Norbert. Coloring subgraphs of the Rado graph 26.2 2006. 231-253.
- Sauer, Norbert. Coloring subgraphs of the Rado graph 26.2 2006. 231-253.
- Sauer, Norbert. Coloring subgraphs of the Rado graph 26.2 2006.
- Sauer, Norbert, Sands, Bill, Duffus, Dwight and V. Rodl. Chromatic numbers and homomorphisms of large girth hypergraphs 26. 2006. 455-471.
- Pouzet, Maurice and Sauer, Norbert. From well quasi-ordered sets to better quasi-ordered sets 13.1-3 2006. 27.
- Sauer, Norbert and El-Zahar. Indivisible homogeneous directed graphs and a game for vertex partitions 291.1-3 2005. 99-113.
- Sauer, Norbert and M. El-Zahar. Indivisible homogeneous directed graphs and a game for vertex partitions 291.1-3 2005. 99-113.
- Duffus, Dwight and Sauer, Norbert. Chromatic numbers and products 300.1-3 2005. 91-99.
- Laflamme, Claude and Sauer, Norbert. Canonical partitions of universal structures 26.2 2004. 183-205.
- Sauer, Norbert. Canonical vertex partitions 12.5-6 2003. 671-704.
- Sauer, Norbert. A {R}amsey theorem for countable homogeneous directed graphs 253.1-3 2002. 45-61.
- Laviolette, Fran , Sauer, Norbert and Woodrow, Robert. On cop-win graphs 258.1-3 2002. 27-41.
- Delhomm{\'e}, Christian and Sauer, Norbert. Homomorphisms of products of graphs into graphs without four cycles 22.1 2002. 35-46.
- Kuich, Werner , Sauer, Norbert and Urbanek, Friedrich . Heyting algebras and formal languages 8.7 2002. 722-736 (electronic).
- Sauer, Norbert. Hedetniemi's Conjecture-a survey 229.1-3 2001. 261-292.
- Sauer, Norbert. Hedetniemi's conjecture-a survey 229.1-3 2001. 261-292.
- Sauer, Norbert. Another look at the {E}rd{\H o}s-{H}ajnal-{P}\'osa results on partitioning edges and the {R}ado graph 21.2 2001. 293-308.
- Kuich, Werner and Sauer, Norbert. Atoms and partial orders of infinite languages 35.4 2001. 389-401.
- Delhomm{\'e}, Christian , Pouzet, Maurice and Sauer, Norbert. Jump-number of means on graphs 21.6 2000. 767-775.
- Sauer, Norbert. Edge partitions of the countable triangle free homogeneous graph 185.1-3 1998. 137-181.
- Sauer, Norbert, Woodrow, Robert and R{\"o}dl, Vojtech . Chromatic {R}amsey theory 18.1 1997. 93-102.
- Duffus, Dwight and Sauer, Norbert. Lattices arising in categorial investigations of {H}edetniemi's conjecture 152.1-3 1996. 125-139.
- Pouzet, Maurice and Sauer, Norbert. Edge partitions of the {R}ado graph 16.4 1996. 505-520.
- Sauer, Norbert and {\v{S}}ir{\'a}{\v{n}}, Jozef . The chromatic number of the union of two forests 42. 1996. 161-174.
- Wang, Hong and Sauer, Norbert. Packing of three copies of a graph 21.1 1996. 71-80.
- Sauer, Norbert. On the {R}amsey property of families of graphs 347.3 1995. 785-833.
- R{\"o}dl, V. , Sauer, Norbert and Zhu, X. . Ramsey families which exclude a graph 15.4 1995. 589-596.
- El-Zahar, M. and Sauer, Norbert. On the divisibility of homogeneous hypergraphs 14.2 1994. 159-165.
- P{\"o}schel, R. , Sapir, M. V., Sauer, Norbert, Stone, Mike and Volkov, M. V.. Identities in full transformation semigroups 31.4 1994. 580-588.
- Droste, Manfred , Giraudet, Mich , Macpherson, Dugald and Sauer, Norbert. Set-homogeneous graphs 62.1 1994. 63-95.
- Wang, Hong and Sauer, Norbert. Packing three copies of a tree into a complete graph 14.2 1993. 137-142.
- Hajnal, A. and Sauer, Norbert. Cut-sets in infinite graphs and partial orders 117.1-3 1993. 113-125.
- Boroczky, K. , Sauer, Norbert and Zhu, X. . Inexhaustible homogeneous structures 115.1-3 1993. 57-63.
- El-Zahar, M. and Sauer, Norbert. On the divisibility of homogeneous directed graphs 45.2 1993. 284-294.
- Kaiser, H. K. and Sauer, Norbert. On order polynomially complete lattices 30.2 1993. 171-176.
- Gunderson, David, R{\"o}dl, Vojt and Sauer, Norbert. Finite induced graph {R}amsey theory: on partitions of subgraphs 59.2 1993. 199-209.
- Duffus, Dwight, R{\"o}dl, V. , Sauer, Norbert and Woodrow, Robert. Coloring ordered sets to avoid monochromatic maximal chains 44.1 1992. 91-103.
- R{\"o}dl, V. and Sauer, Norbert. The {R}amsey property for families of graphs which exclude a given graph 44.5 1992. 1050-1060.
- Hor{\'a}k, Peter and Sauer, Norbert. Covering complete graphs by cliques 33. 1992. 279-288.
- Sauer, Norbert and Zhu, X. . An approach to {H}edetniemi's conjecture 16.5 1992. 423-436.
- Sauer, Norbert and Zhu, Xu . Multiplicative posets 8.4 1991/92. 349-358.
- Pach, J. and Sauer, Norbert. On the average volume of subsets in {E}uclidean {$d$}-space 12.5 1991. 417-421.
- El-Zahar, M. and Sauer, Norbert. Ramsey-type properties of relational structures 94.1 1991. 1-10.
- Duffus, Dwight, Sands, Bill, Sauer, Norbert and Woodrow, Robert. Two-colouring all two-element maximal antichains 57.1 1991. 109-116.
- Sauer, Norbert and Stone, Mike . Composing functions to reduce image size 31. 1991. 171-176.
- Sauer, Norbert and Stone, Mike . Endomorphism monoids of algebras whose subalgebra lattices are chains 28.2 1991. 214-229.
- Sauer, Norbert and Stone, Mike . On a problem of {B}. {J}\'onsson concerning subalgebras and endomorphisms 27.3 1990. 385-386.
- Gunderson, David, R{\"o}dl, Vojt and Sauer, Norbert. Some results in finite graph {R}amsey theory 79. 1990. 232-243.
- Sauer, Norbert and Stone, Mike . Foliations and applications to structure problems 53.1-2 1989. 43-54.
- Sauer, Norbert and Stone, Mike . Preemptive scheduling of interval orders is polynomial 5.4 1989. 345-348.
- El-Zahar, M. and Sauer, Norbert. The indivisibility of the homogeneous {$K\sb n$}-free graphs 47.2 1989. 162-170.
- El-Zahar, M. and Sauer, Norbert. Asymptotic enumeration of two-dimensional posets 5.3 1988. 239-244.
- Duffus, Dwight and Sauer, Norbert. Fixed points of products and the strong fixed point property 4.3 1987. 221-231.
- Sauer, Norbert and Stone, Mike . Rational preemptive scheduling 4.2 1987. 195-206.
- Bialostocki, A. and Sauer, Norbert. On {R}amsey-{T}ur\'an type problems in tournaments 59.3 1986. 221-228.
- Hajnal, A. and Sauer, Norbert. Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets 59.1-2 1986. 61-67.
- El-Zahar, M. and Sauer, Norbert. The chromatic number of the product of two {$4$}-chromatic graphs is {$4$} 5.2 1985. 121-126.
- El-Zahar, Mohamed and Sauer, Norbert. The length, the width and the cutset-number of finite ordered sets 2.3 1985. 243-248.
- Sauer, Norbert and Woodrow, Robert. Finite cutsets and finite antichains 1.1 1984. 35-46.
- Sands, Bill, Sauer, Norbert and Woodrow, Robert. On monochromatic paths in edge-coloured digraphs 33.3 1982. 271-275.
- Milner, E. C. and Sauer, Norbert. Remarks on the cofinality of a partially ordered set, and a generalization of {K}\"onig's lemma 35. 1981. 165-171.
- Milner, E. C. and Sauer, Norbert. On chains and antichains in well-founded partially ordered sets 24.1 1981. 15-33.
- Birkenhead, R. , Sauer, Norbert and Stone, Mike . The algebraic representation of semigroups and lattices;\ representing lattice extensions 43.3-4 1981. 255-261.
- Sauer, Norbert and Stone, Mike . The algebraic representation of semigroups and lattices;\ representing subsemigroups 42.3-4 1980. 313-323.
- Sauer, Norbert and Spencer, Joel . Edge disjoint placement of graphs 25.3 1978. 295-302.
- T{\'o}th, L. and Sauer, Norbert. Thinnest packing of cubes with a given number of neighbours 20.4 1977. 501-507.
- Sauer, Norbert and Stone, Mike . Endomorphism and subalgebra structure; a concrete characterization 39.3-4 1977. 397-402.
- Sauer, Norbert and Stone, Mike . The algebraic closure of a function 7.3 1977. 295-306.
- Sauer, Norbert and Stone, Mike . The algebraic closure of a semigroup of functions 7.2 1977. 219-233.
- Bollob{\'a}s, B and Sauer, Norbert. Uniquely colourable graphs with large girth 28.6 1976. 1340-1344.
- Erd{\H{o}}s, Paul , Sauer, Norbert, Schaer, Jonathan and Spencer, Joel . Factorizing the complete graph into factors with large star number 18. 1975. 180-183.
- Sauer, Norbert and Schaer, Jonathan. On the factorization of the complete graph 14. 1973. 1-6.
- Sauer, Norbert. On the density of families of sets 13. 1972. 145-147.
- Abbott, H. L., Hanson, D. and Sauer, Norbert. Intersection theorems for systems of sets 12. 1972. 381-389.
- Sauer, Norbert. On the maximal number of edges in graphs with a given number of edge-disjoint triangles 4. 1971. 153-156.
- Sauer, Norbert. A generalization of a theorem of {T}ur\'an 10. 1971. 109-112.
- Sauer, Norbert. On the factorisation of the complete graph into factors of diameter {$2$} 9. 1970. 423-426.
- Sauer, Norbert. On the existence of regular {$n$}-graphs with given girth 9. 1970. 144-147.
- Milner, E. C. and Sauer, Norbert. Generalizations of a lemma of {F}olkman 175. 1970. 295-307.
- Sauer, Norbert and Sch{\"o}nheim, J. . Maximal subsets of a given set having no triple in common with a {S}teiner triple system on the set 12. 1969. 777-778.
- Sauer, Norbert. Extremal point and edge sets in {$n$}-graphs 21. 1969. 1069-1075.
- Sauer, Norbert. Extremaleigenschaften regul\"arer {G}raphen gegebener {T}aillenweite. {I}, {II} 176. 1967. 27-43.
Preprint
Powered by UNITIS. More features.