Primitive bound of a 2-structure
From MaRDI portal
Publication:344441
Abstract: A 2-structure on a set is given by an equivalence relation on the set of ordered pairs of distinct elements of . A subset of , any two elements of which appear the same from the perspective of each element of the complement of , is called a clan. The number of elements that must be added in order to obtain a 2-structure the only clans of which are trivial is called the primitive bound of the 2-structure. The primitive bound is determined for arbitrary 2-structures of any cardinality. This generalizes the classical results of ErdH{o}s et al. and Moon for tournaments, as well as the result of Brignall et al. for finite graphs, and the precise results of Boussa"{i}ri and Ille for finite graphs, providing new proofs which avoid extensive use of induction in the finite case.
Recommendations
Cited in
(6)- Critically twin primitive 2-structures
- Making a tournament indecomposable by one subtournament-reversal operation
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
- A tight lower bound for primitivity in k-structures
- A type of algebraic structure related to sets of intervals
- Angular 2-structures
This page was built for publication: Primitive bound of a 2-structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344441)