Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
From MaRDI portal
Publication:1226161
DOI10.1007/BF01215230zbMath0327.20002OpenAlexW2060284228MaRDI QIDQ1226161
Publication date: 1976
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/172411
Related Items (36)
Graphs determined by their finite induced subgraphs ⋮ Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments) ⋮ Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms ⋮ The idiosyncratic polynomial of digraphs ⋮ Maximally embeddable components ⋮ \(\{-1\}\)-self dual finite prechains and applications ⋮ Vaught's conjecture for monomorphic theories ⋮ Sur certains tournois reconstructibles application à leurs groupes d'automorphismes ⋮ Hereditary classes of ordered binary structures ⋮ When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron ⋮ The pairs of \(\{-3\}\)-hypomorphic tournaments ⋮ Indecomposability graph and indecomposability recognition ⋮ Sur les graphes 2-reconstructibles (On the 2-reconstructible graphs) ⋮ Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile ⋮ \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets ⋮ Stories about groups and sequences ⋮ The age of a relational structure ⋮ The morphology of infinite tournaments; application to the growth of their profile ⋮ The half-isomorphy and the finite strongly connected tournaments ⋮ What is reconstruction for ordered sets? ⋮ Rélations non reconstructibles par leurs restrictions ⋮ Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments ⋮ The number of infinite substructures ⋮ European meeting of the Association for Symbolic Logic, Mons, Belgium, 1978 ⋮ Equality of graphs up to complementation ⋮ Hypomorphy of graphs up to complementation ⋮ Reconstructing subsets of \(\mathbb{Z}_n\) ⋮ Sperner properties for groups and relations ⋮ Reconstruction of posets with the same comparability graph ⋮ On the number of edges of a graph and its complement ⋮ Quotients of Peck posets ⋮ Half-isomorphy, selfduality and finite non strongly connected tournaments ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic ⋮ Morphisms for the strong Sperner property of Stanley and Griggs ⋮ La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations) ⋮ \(k\)-spectrally monomorphic tournaments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A congruence theorem for trees
- Rélations non reconstructibles par leurs restrictions
- Transitivity of finite permutation groups on unordered sets
- Note on a theorem of Livingstone and Wagner
- Endliche \(k\)-homogene Permutationsgruppen
- Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
- Set-Transitive Permutation Groups
This page was built for publication: Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
