Search Results - "Mammoliti, Adam"

Wei-type duality theorems for rank metric codes by Britz, Thomas, Mammoliti, Adam, Shiromoto, Keisuke

“…We extend and provide new proofs of the Wei-type duality theorems, due to Ducoat and Ravagnani, for Gabidulin–Roth rank-metric codes and for Delsarte…”
Get full text

Maximal sets of mutually orthogonal frequency squares by Cavenagh, Nicholas J., Mammoliti, Adam, Wanless, Ian M.

“…A frequency square is a square matrix in which each row and column is a permutation of the same multiset of symbols. A frequency square is of type ( n ; λ ) if…”
Get full text

The $r$-Matching Sequencibility of Complete Graphs by Mammoliti, Adam

“…Alspach [ Bull. Inst. Combin. Appl., 52 (2008), pp. 7--20] defined the maximal matching sequencibility of a graph $G$, denoted $ms(G)$, to be the largest…”
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

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

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

Mutually Orthogonal Binary Frequency Squares by Britz, Thomas, Cavenagh, Nicholas J., Mammoliti, Adam, Wanless, Ian M.

“…A frequency square is a matrix in which each row and column is a permutation of the same multiset of symbols. We consider only binary frequency squares of…”
Get full text

Latin squares with maximal partial transversals of many lengths by Evans, Anthony B., Mammoliti, Adam, Wanless, Ian M.

“…A partial transversal T of a Latin square L is a set of entries of L in which each row, column and symbol is represented at most once. A partial transversal is…”
Get full text

The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs by Mammoliti, Adam

“…Alspach [{\sl Bull. Inst. Combin. Appl.}~{\bf 52} (2008), 7--20] defined the maximal matching sequencibility of a graph $G$, denoted~$ms(G)$, to be the largest…”
Get full text

Intersection theorems for families of matchings of complete $k$-partite $k$-graphs by Mammoliti, Adam

“…The celebrated Erd\H{o}s-Ko-Rado Theorem and other intersection theorems on families of sets have previously been generalised with respect to families of…”
Get full text

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

“…J. Combin. Des. (2024), 32, 556-576 For positive integers $m$ and $n$, the Zarankiewicz number $Z_{2,2}(m,n)$ can be defined as the maximum total degree of a…”
Get full text

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

“…J. Graph Theory 106 (2024), 81-109 For positive integers $s$, $t$, $m$ and $n$, the Zarankiewicz number $Z_{s,t}(m,n)$ is defined to be the maximum number of…”
Get full text

The $r$-matching sequencibility of complete graphs by Mammoliti, Adam

“…Adam Mammoliti, The r-matching sequencibility of complete graphs, Electron. J. Combin. 25 (2018), Paper 1.6, 23 pp Alspach [ Bull. Inst. Combin. Appl., 52…”
Get full text

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

“…European J. Combin. 118 (2024), 103882, 16 pp Let $\mathcal{F}$ be a family of subsets of a ground set $\{1,\ldots,n\}$ with $|\mathcal{F}|=m$, and let…”
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 $\mathrm{cms}(G)$, is the largest integer $s$ for which there exists a cyclic ordering of…”
Get full text

Canonical labelling of Latin squares in average-case polynomial time by Gill, Michael J, Mammoliti, Adam, Wanless, Ian M

“…A Latin square of order $n$ is an $n\times n$ matrix in which each row and column contains each of $n$ symbols exactly once. For $\epsilon>0$, we show that…”
Get full text

Balanced diagonals in frequency squares by Cavenagh, Nicholas, Mammoliti, Adam

“…We say that a diagonal in an array is {\em $\lambda$-balanced} if each entry occurs $\lambda$ times. Let $L$ be a frequency square of type $F(n;\lambda^m)$;…”
Get full text

On Mubayi's Conjecture and conditionally intersecting sets by Mammoliti, Adam, Britz, Thomas

“…Adam Mammoliti and Thomas Britz. On Mubayi's Conjecture and Conditionally Intersecting Sets. SIAM J. Discrete Math., 32(3): 2361--2380, 2018 Mubayi's…”
Get full text

Latin squares with maximal partial transversals of many lengths by Evans, Anthony B, Mammoliti, Adam, Wanless, Ian

“…Journal of Combinatorial Theory, Series A 180 (2021) 105403 A partial transversal $T$ of a Latin square $L$ is a set of entries of $L$ in which each row,…”
Get full text