Results 21 to 30 of about 2,160 (213)
Total dominator chromatic number of Kneser graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Decomposition into special substructures inheriting significant properties is an important method for the investigation of some mathematical structures. A total dominator coloring (briefly, a TDC) of a graph G is a proper coloring (i.e.
Parvin Jalilolghadr, Ali Behtoei
doaj +1 more source
Hypergraphs with infinitely many extremal constructions
Discrete Analysis, 2023 Hypergraphs with infinitely many extremal constructions, Discrete Analysis 2023:18, 34 pp. A fundamental result in extremal graph theory, Turán's theorem, states that the maximal number of edges of a graph with $n$ vertices that does not contain a ...
Jianfeng Hou +4 more
doaj +1 more source
Unbalanced steiner triple systems
Journal of Combinatorial Theory, Series A, 1994 The authors study colouring properties of Steiner triple systems and derive several inequalities for sizes of their colour classes. Answering a question of A. Rosa, they give a construction (for any \(l\geq 6\)) of a family of \(l\)-chromatic Steiner triple systems with the following remarkable property: No matter how they are \(l\)-coloured, almost ...
Lucien Haddad, Vojtech Rödl
openaire +1 more source
European Journal of Personality, EarlyView., 2020 Abstract Divergent thinking (DT) is an important constituent of creativity that captures aspects of fluency and originality. The literature lacks multivariate studies that report relationships between DT and its aspects with relevant covariates, such as cognitive abilities, personality traits (e.g. openness), and insight. In two multivariate studies (N
S. Weiss +6 more
wiley +1 more source
Nonsequenceable Steiner triple systems [PDF]
Bull. ICA, 2019 A partial Steiner triple system is is $sequenceable$ if the points can be sequenced so that no proper segment can be partitioned into blocks. We show that, if $0 \leq a \leq (n-1)/3$, then there exists a nonsequenceable PSTS$(n)$ of size $\frac{1}{3}\binom{n}{2}-a$, for all $n \equiv 1 \pmod{6}$ except for $n=7$.
Donald L. Kreher, Douglas R. Stinson
openaire +2 more sources
Countable homogeneous Steiner triple systems avoiding specified subsystems [PDF]
, 2021 In this article we construct uncountably many new homogeneous locally finite Steiner triple systems of countably infinite order as Fraïssé limits of classes of finite Steiner triple systems avoiding certain subsystems.
Horsley, Daniel, Webb, Bridget S.
core +1 more source
Halving Steiner triple systems
Discrete Mathematics, 1992 A halving of a Steiner triple system (STS) is a partition of its triples into two classes, so that the set of triples in each class are isomorphic as hypergraphs. If such an isomorphism is an automorphism of the STS, the halving is called strong. STS that can be strongly halved are shown to exist if and only if the order is 1 or 9 modulo 24.
Pramod K. Das, Alexander Rosa
openaire +1 more source
On colourings of Steiner triple systems
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. D. Forbes +2 more
openaire +2 more sources
Combinatorial Intricacies of Labeled Fano Planes
Entropy, 2016 Given a seven-element set X = { 1 , 2 , 3 , 4 , 5 , 6 , 7 } , there are 30 ways to define a Fano plane on it. Let us call a line of such a Fano plane—that is to say an unordered triple from X—ordinary or defective, according to whether the sum of ...
Metod Saniga
doaj +1 more source
Cavity Quantum Electrodynamics (CQED)-Based Quantum LDPC Encoders and Decoders
IEEE Photonics Journal, 2011 Quantum information processing (QIP) relies on delicate superposition states that are sensitive to interactions with environment, resulting in errors. Moreover, the quantum gates are imperfect so that the use of quantum error correction coding (QECC) is ...
Ivan B. Djordjevic
doaj +1 more source