Results 1 to 10 of about 38,789 (85)
An electromagnetism-like method for the maximum set splitting problem [PDF]
Yugoslav Journal of Operations Research, 2013 In this paper, an electromagnetism-like approach (EM) for solving the maximum set splitting problem (MSSP) is applied. Hybrid approach consisting of the movement based on the attraction-repulsion mechanisms combined with the proposed scaling technique
Kratica Jozef
doaj +3 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 +4 more sources
Examples and Counterexamples, 2022 This note is motivated by recent work by Feng et al. (2021) which studies Novák’s conjecture for Steiner Triple Systems and extends it to cyclic Steiner 2-designs, and more generally to cyclic 2-designs.
Marco Buratti, Francesca Merola
doaj +1 more source
The 3-way flower intersection problem for Steiner triple systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 The flower at a point x in a Steiner triple system (X; B) is the set of all triples containing x. Denote by J3F(r) the set of all integers k such that there exists a collection of three STS(2r+1) mutually intersecting in the same set of k + r triples, r ...
H. Amjadi, N. Soltankhah
doaj +1 more source
Journal of Mathematics, 2023 In this article, we adapt the edge-graceful graph labeling definition into block designs and define a block design V,B with V=v and B=b as block-graceful if there exists a bijection f:B⟶1,2,…,b such that the induced mapping f+:V⟶Zv given by f+x=∑x∈AA ...
Dilara Erdemir, Emre Kolotoğlu
doaj +1 more source
An algebraic representation of Steiner triple systems of order 13
Examples and Counterexamples, 2021 In this paper we construct an incidence structure isomorphic to a Steiner triple system of order 13 by defining a set B of twentysix vectors in the 13-dimensional vector space V=GF(5)13, with the property that there exist precisely thirteen 6-subsets of ...
Marco Pavone
doaj +1 more source
Almost all Steiner triple systems are almost resolvable
Forum of Mathematics, Sigma, 2020 We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost all Steiner triple systems are almost resolvable).
Asaf Ferber, Matthew Kwan
doaj +1 more source
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
A second infinite family of Steiner triple systems without almost parallel classes [PDF]
, 2013 For each positive integer n, we construct a Steiner triple system of order v=2(3n)+1 with no almost parallel class; that is, with no set of v-13 disjoint triples. In fact, we construct families of (v,k,λ)-designs with an analogous property.
Colbourn +9 more
core +1 more source