The following pages link to Norbert W. Sauer (Q532123):
Displaying 50 items.
- (Q175605) (redirect page) (← links)
- Pairs of orthogonal countable ordinals (Q400437) (← links)
- Partition properties of the dense local order and a colored version of Milliken's theorem (Q532124) (← links)
- Partitions and indivisibility properties of countable dimensional vector spaces (Q616440) (← links)
- The order on the rationals has an orthogonal order with the same order type (Q651428) (← links)
- Vertex partitions of metric spaces with finite distance sets (Q658028) (← links)
- Cut-sets in infinite graphs and partial orders (Q686154) (← links)
- On a problem of B. Jónsson concerning subalgebras and endomorphisms (Q753852) (← links)
- Edge disjoint placement of graphs (Q754889) (← links)
- Finite cutsets and finite antichains (Q802580) (← links)
- Coloring subgraphs of the Rado graph (Q858115) (← links)
- From well-quasi-ordered sets to better-quasi-ordered sets (Q870020) (← links)
- Foliations and applications to structure problems (Q909685) (← links)
- Preemptive scheduling of interval orders is polynomial (Q913500) (← links)
- Indivisible ultrametric spaces (Q935250) (← links)
- Some weak indivisibility results in ultrahomogeneous metric spaces (Q976169) (← links)
- Representation of ideals of relational structures (Q1024444) (← links)
- The Urysohn sphere is oscillation stable (Q1034684) (← links)
- (Q1063619) (redirect page) (← links)
- The chromatic number of the product of two 4-chromatic graphs is 4 (Q1063620) (← links)
- The length, the width and the cutset-number of finite ordered sets (Q1068861) (← links)
- On Ramsey-Turán type problems in tournaments (Q1071781) (← links)
- Rational preemptive scheduling (Q1105366) (← links)
- Fixed points of products and the strong fixed point property (Q1106249) (← links)
- Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets (Q1109032) (← links)
- Asymptotic enumeration of two-dimensional posets (Q1122599) (← links)
- Remarks on the cofinality of a partially ordered set, and a generalization of König's lemma (Q1154479) (← links)
- On monochromatic paths in edge-coloured digraphs (Q1165860) (← links)
- Endomorphism monoids of algebras whose subalgebra lattices are chains (Q1175930) (← links)
- Two-colouring all two-element maximal antichains (Q1176381) (← links)
- On the average volume of subsets in Euclidean \(d\)-space (Q1178025) (← links)
- Ramsey-type properties of relational structures (Q1182733) (← links)
- Multiplicative posets (Q1198481) (← links)
- Packing three copies of a tree into a complete graph (Q1209730) (← links)
- The algebraic closure of a semigroup of functions (Q1239751) (← links)
- The algebraic closure of a function (Q1242179) (← links)
- Finite induced graph Ramsey theory: On partitions of subgraphs (Q1322033) (← links)
- On the divisibility of homogeneous hypergraphs (Q1330801) (← links)
- Identities in full transformation semigroups (Q1333296) (← links)
- Set-homogeneous graphs (Q1333326) (← links)
- Edge partitions of the Rado graph (Q1375697) (← links)
- Factorizing the complete graph into factors with large star number (Q1394237) (← links)
- Jump-number of means on graphs (Q1582483) (← links)
- Edge partitions of the countable triangle free homogeneous graph (Q1584244) (← links)
- Homomorphisms of products of graphs into graphs without four cycles (Q1603261) (← links)
- A Ramsey theorem for countable homogeneous directed graphs (Q1613517) (← links)
- Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif (Q1688271) (← links)
- Indivisible homogeneous directed graphs and a game for vertex partitions (Q1772271) (← links)
- Inexhaustible homogeneous structures (Q1801688) (← links)
- On order polynomially complete lattices (Q1802250) (← links)
