Search Results - "Horsley, Daniel"

Existential closure of block intersection graphs of infinite designs having infinite block size by Horsley, Daniel, Pike, David A., Sanaei, Asiyeh

“…A graph G is n‐existentially closed (n‐e.c.) if for each pair (A, B) of disjoint subsets of V(G) with |A| + |B|≤n there exists a vertex in V(G)\(A∪B) which is…”
Get full text

Generalising Fisher’s inequality to coverings and packings by Horsley, Daniel

“…In 1940 Fisher famously showed that if there exists a non-trivial ( v,k,λ )-design, then λ( v -1)⩾ k ( k -1). Subsequently Bose gave an elegant alternative…”
Get full text

The cyclic matching sequenceability of regular graphs by Horsley, Daniel, Mammoliti, Adam

“…The cyclic matching sequenceability of a simple graph G, denoted cms ( G ), is the largest integer s for which there exists a cyclic ordering of the edges of G…”
Get full text

More constructions for Sperner partition systems by Gowty, Adam, Horsley, Daniel

“…An ( n , k )‐Sperner partition system is a set of partitions of some n‐set such that each partition has k nonempty parts and no part in any partition is a…”
Get full text

Exact values for some unbalanced Zarankiewicz numbers by Chen, Guangzhou, Horsley, Daniel, Mammoliti, Adam

“…For positive integers s $s$, t $t$, m $m$ and n $n$, the Zarankiewicz number Zs , t(m , n ) ${Z}_{s,t}(m,n)$ is defined to be the maximum number of edges in a…”
Get full text

Countable homogeneous Steiner triple systems avoiding specified subsystems by Horsley, Daniel, Webb, Bridget S.

“…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…”
Get full text

Minimising the total number of subsets and supersets by Gowty, Adam, Horsley, Daniel, Mammoliti, Adam

“…Let F be a family of subsets of a ground set {1,…,n} with |F|=m, and let F↕ denote the family of all subsets of {1,…,n} that are subsets or supersets of sets…”
Get full text

Zarankiewicz numbers near the triple system threshold by Chen, Guangzhou, Horsley, Daniel, Mammoliti, Adam

“…For positive integers m $m$ and n $n$, the Zarankiewicz number Z2,2(m,n) ${Z}_{2,2}(m,n)$ can be defined as the maximum total degree of a linear hypergraph…”
Get full text

New lower bounds for t‐coverings by Horsley, Daniel, Singh, Rakhi

“…Fisher proved in 1940 that any 2‐(v,k,λ) design with v>k has at least v blocks. In 1975, Ray‐Chaudhuri and Wilson generalized this result by showing that every…”
Get full text

Novák's conjecture on cyclic Steiner triple systems and its generalization by Feng, Tao, Horsley, Daniel, Wang, Xiaomiao

“…Novák conjectured in 1974 that for any cyclic Steiner triple systems of order v with v≡1(mod6), it is always possible to choose one block from each block orbit…”
Get full text

Small Embeddings of Partial Steiner Triple Systems by Horsley, Daniel

“…It was proved in 2009 that any partial Steiner triple system of order u has an embedding of order v for each admissible v≥2u+1. This result is best possible in…”
Get full text

Bounds on data limits for all-to-all comparison from combinatorial designs by Hall, Joanne, Horsley, Daniel, Stinson, Douglas R.

“…In situations where every item in a data set must be compared with every other item in the set, it may be desirable to store the data across a number of…”
Get full text

Cycle decompositions V: Complete graphs into cycles of arbitrary lengths by Bryant, Darryn, Horsley, Daniel, Pettersson, William

“…We show that the complete graph on n vertices can be decomposed into t cycles of specified lengths m 1, …, m t if and only if n is odd, 3≤m i ≤n for i=1, …, t,…”
Get full text

SUE(s2)-optimal supersaturated designs by Singh, Rakhi, Das, Ashish, Horsley, Daniel

“…This paper finds a lower bound to the criterion SS, that picks the designs with good lower-dimensional projections among many UE(s2)-optimal designs. In…”
Get full text

Decomposing Ku+w−Ku into cycles of prescribed lengths by Horsley, Daniel, Hoyte, Rosalind A.

“…We prove that the complete graph with a hole Ku+w−Ku can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary…”
Get full text

Smaller Embeddings of Partial $k$-Star Decompositions by De Vas Gunasekara, Ajani, Horsley, Daniel

“…A $k$-star is a complete bipartite graph $K_{1,k}$. For a graph $G$, a $k$-star decomposition of $G$ is a set of $k$-stars in $G$ whose edge sets partition the…”
Get full text

Decomposing K u + w − K u into cycles of prescribed lengths by Horsley, Daniel, Hoyte, Rosalind A.

Get full text

Decomposing Various Graphs into Short Even-Length Cycles by Horsley, Daniel

“…We prove that a complete bipartite graph can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are…”
Get full text

Maximum packings of the complete graph with uniform length cycles by Horsley, Daniel

“…In this paper we find the maximum number of pairwise edge‐disjoint m‐cycles which exist in a complete graph with n vertices, for all values of n and m with…”
Get full text

Induced path factors of regular graphs by Akbari, Saieed, Horsley, Daniel, Wanless, Ian M.

“…An induced path factor of a graph G is a set of induced paths in G with the property that every vertex of G is in exactly one of the paths. The induced path…”
Get full text