default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNorbert Sauer
Person information
- affiliation: University of Calgary, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j56]Anthony Bonato, Claude Laflamme, M. Pawliuk, Norbert Sauer:
Distinguishing Number of Universal Homogeneous Urysohn Metric Spaces. Electron. J. Comb. 29(3) (2022)- 2021
- [j55]Claude Laflamme, Maurice Pouzet, Norbert Sauer, Robert E. Woodrow:
Siblings of an ℵ0-categorical relational structure. Contributions Discret. Math. 16(2): 90-127 (2021) - [j54]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): 353-381 (2021)
2010 – 2019
- 2017
- [j53]Norbert Sauer, Imed Zaguia:
Permutations avoiding connected graphs. Contributions Discret. Math. 12(2) (2017) - 2016
- [j52]Natasha Dobrinen, Claude Laflamme, Norbert Sauer:
Rainbow Ramsey simple structures. Discret. Math. 339(11): 2848-2855 (2016) - 2014
- [j51]Claude Laflamme, Maurice Pouzet
, Norbert Sauer, Imed Zaguia:
Pairs of orthogonal countable ordinals. Discret. Math. 335: 35-44 (2014) - [j50]Norbert Sauer:
Age and weak indivisibility. Eur. J. Comb. 37: 24-31 (2014) - 2013
- [p1]Hong Wang, Norbert Sauer:
The Chromatic Number of the Two-Packing of a Forest. The Mathematics of Paul Erdős II 2013: 143-166 - 2012
- [j49]Norbert W. Sauer:
Vertex partitions of metric spaces with finite distance sets. Discret. Math. 312(1): 119-128 (2012) - 2011
- [j48]Péter Komjáth, Jean A. Larson, Norbert Sauer:
The quasi order of graphs on an ordinal. Discret. Math. 311(15): 1451-1460 (2011) - [j47]Claude Laflamme, Lionel Nguyen Van Thé, Maurice Pouzet, Norbert W. Sauer:
Partitions and indivisibility properties of countable dimensional vector spaces. J. Comb. Theory A 118(1): 67-77 (2011) - [j46]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]Norbert W. Sauer:
On the General Coloring Problem. Rainbow of Computer Science 2011: 116-126 - 2010
- [j45]Claude Laflamme, Lionel Nguyen Van Thé, Norbert W. Sauer:
Partition properties of the dense local order and a colored version of Milliken's theorem. Comb. 30(1): 83-104 (2010) - [j44]Claude Laflamme, Lionel Nguyen Van Thé, Norbert Sauer:
Distinguishing Number of Countable Homogeneous Relational Structures. Electron. J. Comb. 17(1) (2010) - [j43]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
- [j42]Christian Delhommé, Maurice Pouzet, Gábor Sági, Norbert Sauer:
Representation of ideals of relational structures. Discret. Math. 309(6): 1374-1384 (2009) - 2007
- [j41]Christian Delhommé, Claude Laflamme, Maurice Pouzet, Norbert Sauer:
Divisibility of countable metric spaces. Eur. J. Comb. 28(6): 1746-1769 (2007) - 2006
- [j40]Claude Laflamme, Norbert W. Sauer, Vojkan Vuksanovic:
Canonical Partitions Of Universal Structures. Comb. 26(2): 183-205 (2006) - [j39]Norbert W. Sauer:
Coloring Subgraphs of the Rado Graph. Comb. 26(2): 231-253 (2006) - [j38]Maurice Pouzet, Norbert Sauer:
From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets. Electron. J. Comb. 13(1) (2006) - 2005
- [j37]Mohamed M. El-Zahar, Norbert Sauer:
Indivisible homogeneous directed graphs and a game for vertex partitions. Discret. Math. 291(1-3): 99-113 (2005) - [j36]Dwight Duffus, Norbert W. Sauer:
Chromatic numbers and products. Discret. Math. 300(1-3): 91-99 (2005) - 2003
- [j35]Norbert W. Sauer:
Canonical Vertex Partitions. Comb. Probab. Comput. 12(5-6): 671-704 (2003) - 2002
- [j34]Christian Delhommé, Norbert Sauer:
Homomorphisms of Products of Graphs into Graphs Without Four Cycles. Comb. 22(1): 35-46 (2002) - [j33]Norbert W. Sauer:
A Ramsey theorem for countable homogeneous directed graphs. Discret. Math. 253(1-3): 45-61 (2002) - [j32]Gena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow:
On cop-win graphs. Discret. Math. 258(1-3): 27-41 (2002) - [j31]Werner Kuich, Norbert Sauer, Friedrich J. Urbanek:
Heyting Algebras and Formal Languages. J. Univers. Comput. Sci. 8(7): 722- (2002) - 2001
- [j30]Norbert Sauer:
Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph. Comb. 21(2): 293-308 (2001) - [j29]Norbert Sauer:
Hedetniemi's conjecture -- a survey. Discret. Math. 229(1-3): 261-292 (2001) - [j28]Werner Kuich, Norbert Sauer:
Atoms and partial orders of infinite languages. RAIRO Theor. Informatics Appl. 35(4): 389-401 (2001) - 2000
- [j27]Christian Delhommé, Maurice Pouzet, Norbert Sauer:
Jump-number of Means on Graphs. Eur. J. Comb. 21(6): 767-775 (2000)
1990 – 1999
- 1998
- [j26]Norbert Sauer:
Edge partitions of the countable triangle free homogeneous graph. Discret. Math. 185(1-3): 137-181 (1998) - 1997
- [j25]Norbert Sauer, Robert E. Woodrow, Vojtech Rödl:
Chromatic Ramsey Theory. Eur. J. Comb. 18(1): 93-102 (1997) - 1996
- [j24]Norbert Sauer, Jozef Sirán:
The chromatic number of the union of two forests. Ars Comb. 42 (1996) - [j23]Maurice Pouzet, Norbert Sauer:
Edge Partitions of the Rado Graph. Comb. 16(4): 505-520 (1996) - [j22]Dwight Duffus, Norbert Sauer:
Lattices arising in categorial investigations of Hedetniemi's conjecture. Discret. Math. 152(1-3): 125-139 (1996) - [j21]Hong Wang, Norbert Sauer:
Packing of three copies of a graph. J. Graph Theory 21(1): 71-80 (1996) - 1995
- [j20]Vojtech Rödl, Norbert Sauer, Xuding Zhu:
Ramsey Families which Exclude a Graph. Comb. 15(4): 589-596 (1995) - 1994
- [j19]Mohamed M. El-Zahar, Norbert Sauer:
On the Divisibility of Homogeneous Hypergraphs. Comb. 14(2): 159-165 (1994) - [j18]Manfred Droste, Dugald Macpherson, Norbert Sauer, Michèle Giraudet:
Set-Homogeneous Graphs. J. Comb. Theory B 62(1): 63-95 (1994) - 1993
- [j17]Károly J. Böröczky, Norbert Sauer, X. Zhu:
Inexhaustible homogeneous structures. Discret. Math. 115(1-3): 57-63 (1993) - [j16]András Hajnal, Norbert Sauer:
Cut-sets in infinite graphs and partial orders. Discret. Math. 117(1-3): 113-125 (1993) - [j15]Hong Wang, Norbert Sauer:
Packing Three Copies of a Tree into a Complete Graph. Eur. J. Comb. 14(2): 137-142 (1993) - [j14]David S. Gunderson, Vojtech Rödl, Norbert W. Sauer:
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs. J. Comb. Theory B 59(2): 199-209 (1993) - 1992
- [j13]Norbert W. Sauer, X. Zhu:
An approach to hedetniemi's conjecture. J. Graph Theory 16(5): 423-436 (1992) - 1991
- [j12]Mohamed M. El-Zahar, Norbert W. Sauer:
Ramsey-type properties of relational structures. Discret. Math. 94(1): 1-10 (1991) - [j11]János Pach, Norbert Sauer:
On the Average Volume of Subsets in Euclidean d-Space. Eur. J. Comb. 12(5): 417-421 (1991) - [j10]Dwight Duffus, Bill Sands, Norbert Sauer, Robert E. Woodrow:
Two-colouring all two-element maximal antichains. J. Comb. Theory 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 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. Discret. Math. 59(1-2): 61-67 (1986) - [j7]Arie Bialostocki, Norbert Sauer:
On Ramsey-Turán type problems in tournaments. Discret. Math. 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. Comb. 5(2): 121-126 (1985) - 1982
- [j5]Bill Sands, Norbert Sauer, Robert E. Woodrow:
On monochromatic paths in edge-coloured digraphs. J. Comb. Theory 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. Discret. Math. 35(1-3): 165-171 (1981)
1970 – 1979
- 1978
- [j3]Norbert Sauer, Joel Spencer:
Edge disjoint placement of graphs. J. Comb. Theory B 25(3): 295-302 (1978) - 1972
- [j2]H. L. Abbott, Denis Hanson, Norbert Sauer:
Intersection Theorems for Systems of Sets. J. Comb. Theory A 12(3): 381-389 (1972) - [j1]Norbert Sauer:
On the Density of Families of Sets. J. Comb. Theory A 13(1): 145-147 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-08 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
