Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
From MaRDI portal
Publication:2540894
Cites work
Cited in
(23)- Graph reconstruction—a survey
- Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
- Sperner properties for groups and relations
- Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
- Relational structures having finitely many full-cardinality restrictions
- The 116 reducts of (ℚ, <, a)
- Hereditary classes of ordered binary structures
- The lattice of definability: origins, recent developments, and further directions
- Vaught's conjecture for almost chainable theories
- The reducts of the homogeneous binary branching C-relation
- Sur certains tournois reconstructibles application à leurs groupes d'automorphismes
- Rélations non reconstructibles par leurs restrictions
- Characterization of \(k\)-spectrally monomorphic Hermitian matrices
- Siblings of an \(\aleph_0\)-categorical relational structure
- Vaught's conjecture for theories admitting finite monomorphic decompositions
- Ordered structures with no finite monomorphic decomposition: application to the profile of hereditary classes
- Lattice of definability (of reducts) for integers with successor
- Lattice of definability in the order of rational numbers
- Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments)
- Condition de chaîne en théorie des rélations
- Well-quasi-ordering and Embeddability of Relational Structures
- Copies of monomorphic structures
- Vaught's conjecture for monomorphic theories
This page was built for publication: Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2540894)
