Results 31 to 40 of about 38,862 (155)
A proof of the Elliott–Rödl conjecture on hypertrees in Steiner triple systems
Hypertrees are linear hypergraphs where every two vertices are connected by a unique path. Elliott and Rödl conjectured that for any given $\mu>0$ , there exists $n_0$ such that the following holds.
Seonghyuk Im +3 more
doaj +1 more source
Spanning trees of 3-uniform hypergraphs [PDF]
Masbaum and Vaintrob's "Pfaffian matrix tree theorem" implies that counting spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done in polynomial time for a class of "3-Pfaffian" 3-graphs, comparable to and related to the class of ...
Andrew Goodall, Anna, De Mier
core
Counting Steiner triple systems with classical parameters and prescribed rank
By a famous result of Doyen, Hubaut and Vandensavel \cite{DHV}, the 2-rank of a Steiner triple system on $2^n-1$ points is at least $2^n -1 -n$, and equality holds only for the classical point-line design in the projective geometry $PG(n-1,2)$.
Jungnickel, Dieter, Tonchev, Vladimir D.
core +1 more source
ABSTRACT The increasing prevalence of corporate scandals and dysfunction linked to psychopathic leaders has prompted significant research into the drivers and effects of psychopathy in business. This paper examines corporate psychopathy, focusing on individuals with extreme selfishness, callousness, and manipulative behavior who often achieve ...
Florian Fuchs
wiley +1 more source
Abstract BACKGROUND Temperature and moisture content are recognized as the main factors responsible for mycotoxin production in stored grain, while the role of gaseous environment, particularly interstitial CO2, remains unexplored. This study investigated the relationship between interstitial CO2 concentration (generated metabolically in air spaces ...
Aanchal Pande +3 more
wiley +1 more source
The Embedding Problem of Any Steiner Triple Systems Into Kite-Designs
A G-design V,B is called embedded into an H-design V∪W,C if G is a subgraph of H and there is an injective mapping f:B⟶C such that B is a subgraph of fB for every B∈B.
Yufeng Gao
doaj +1 more source
A Perspective of Multi‐Reflecting TOF MS
ABSTRACT Time‐of‐flight mass spectrometry (TOF MS) excels in rapid and high‐sensitivity analysis, making it a cornerstone of analytical chemistry. But as sample complexity explodes in omics studies, so does the need for higher resolving power to ensure accurate results.
A. N. Verenchikov +3 more
wiley +1 more source
On the Block Coloring of Steiner Triple Systems
A Steiner triple system of order v, STS(v), is an ordered pair S = (V, B), where V is a set of size v and B is a collection of triples of V such that every pair of V is contained in exactly one triple of B.
R. Manaviyat
doaj
Decompositions of the λ-Fold Complete Mixed Graph into Mixed 6-Stars
Graph and digraph decompositions are a fundamental part of design theory. Probably the best known decompositions are related to decomposing the complete graph into 3-cycles (which correspond to Steiner triple systems), and decomposing the complete ...
Robert Gardner, Kazeem Kosebinu
doaj +1 more source
On the Equivalence of Kirkman-Steiner Triple Systems and Sets of Mutually Orthogonal Latin Squares [PDF]
5 pages, 1 article*On the Equivalence of Kirkman-Steiner Triple Systems and Sets of Mutually Orthogonal Latin Squares* (Hedayat, A.; Raktoe, B.
Cornell University. Biometrics Unit. +4 more
core

