A. Mammoliti

activity

20172026

most citedMutually orthogonal binary frequency squares

9 citations · 21 across the 11 of their papers we have counts for

collaborators

Showing math.COShow all

15 papers · 1 filter

math.CO2026

Binary Words Containing Few Abelian Squares

Szilard Zsolt Fazekas, Adam Mammoliti, Robert Mercas +1

Fici and Saarela ([2]) conjectured that a binary word of length n contains at least $⌊ n /4 ⌋$ abelian squares. We slightly extend this conjecture and show that it holds…

math.CO2026

On the Hamiltonicity, traceability and toughness of complements of line graphs

Adam Mammoliti

A coline graph $co (G)$ of a graph $G$ is the graph with vertex set $E (G)$ for which two vertices $e$ and $e^{'}$ of $co (G)$ are adjacent if and only if they are not adja…

math.CO2024★ 1 cited

Canonical labelling of Latin squares in average-case polynomial time

Michael J. Gill, Adam Mammoliti, Ian M. Wanless

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 $ε > 0$ , we show that with high probability a uniform…

math.CO2023

Zarankiewicz numbers near the triple system threshold

Guangzhou Chen, Daniel Horsley, Adam Mammoliti

For positive integers $m$ and $n$ , the Zarankiewicz number $Z_{2, 2} (m, n)$ can be defined as the maximum total degree of a linear hypergraph with $m$ vertices and $n$ edges. Guy det…

math.CO2022★ 1 cited

Minimising the total number of subsets and supersets

Adam Gowty, Daniel Horsley, Adam Mammoliti

Let $F$ be a family of subsets of a ground set ${1, \dots, n}$ with $∣ F ∣ = m$ , and let $F^{↕}$ denote the family of all subsets of $\{1,\ldo…

math.CO2022★ 3 cited

Exact values for unbalanced Zarankiewicz numbers

Guangzhou Chen, Daniel Horsley, Adam Mammoliti

For positive integers $s$ , $t$ , $m$ and $n$ , the Zarankiewicz number $Z_{s, t} (m, n)$ is defined to be the maximum number of edges in a bipartite graph with parts of sizes $m$ and $n…

math.CO2020★ 4 cited

Maximal sets of mutually orthogonal frequency squares

Nicholas J. Cavenagh, Adam Mammoliti, Ian M. Wanless

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 it contains $n / λ$ symb…

math.CO2019★ 9 cited

Mutually orthogonal binary frequency squares

Thomas Britz, Nicholas J. Cavenagh, Adam Mammoliti +1

A \emph{frequency square} is a matrix in which each row and column is a permutation of the same multiset of symbols. We consider only {\em binary} frequency squares of order $n$ wi…

math.CO2019★ 3 cited

Latin squares with maximal partial transversals of many lengths

Anthony B. Evans, Adam Mammoliti, Ian Wanless

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 maximal if it…

math.CO2019

The cyclic matching sequenceability of regular graphs

Daniel Horsley, Adam Mammoliti

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$ so tha…

math.CO2019

The $r$ -matching sequencibility of complete multi- $k$ -partite $k$ -graphs

Adam Mammoliti

Alspach [{\sl Bull. Inst. Combin. Appl.}~{\bf 52} (2008), 7--20] defined the maximal matching sequencibility of a graph $G$ , denoted~ $m s (G)$ , to be the largest integer $s$ for whic…

math.CO2018

Intersection theorems for families of matchings of complete $k$ -partite $k$ -graphs

Adam Mammoliti

The celebrated {Erdős-Ko-Rado} Theorem states that for $n \geq 2 k$ a family $F$ of $k$ subsets of $[n]$ for which each pair of members of $F$ have a non-empty i…

math.CO2018

Balanced diagonals in frequency squares

Nicholas Cavenagh, Adam Mammoliti

We say that a diagonal in an array is {\em $λ$ -balanced} if each entry occurs $λ$ times. Let $L$ be a frequency square of type $F (n; λ^{m})$ ; that is, an $n \times n$ array in which ea…

math.CO2017

On Mubayi's Conjecture and conditionally intersecting sets

Adam Mammoliti, Thomas Britz

Mubayi's Conjecture states that if $F$ is a family of $k$ -sized subsets of $[n] = {1, \dots, n}$ which, for $k \geq d \geq 2$ , satisfies $A_1 \cap\cdots\cap A_d \neq \em…

math.CO2017

The $r$ -matching sequencibility of complete graphs

Adam Mammoliti

Alspach [ Bull. Inst. Combin. Appl., 52 (2008), pp. 7-20] defined the maximal matching sequencibility of a graph $G$ , denoted $m s (G)$ , to be the largest integer $s$ for which there…

Binary Words Containing Few Abelian Squares

On the Hamiltonicity, traceability and toughness of complements of line graphs

Canonical labelling of Latin squares in average-case polynomial time

Zarankiewicz numbers near the triple system threshold

Minimising the total number of subsets and supersets

Exact values for unbalanced Zarankiewicz numbers

Maximal sets of mutually orthogonal frequency squares

Mutually orthogonal binary frequency squares

Latin squares with maximal partial transversals of many lengths

The cyclic matching sequenceability of regular graphs

The r-matching sequencibility of complete multi-k-partite k-graphs

Intersection theorems for families of matchings of complete k-partite k-graphs

Balanced diagonals in frequency squares

On Mubayi's Conjecture and conditionally intersecting sets

The r-matching sequencibility of complete graphs

The $r$ -matching sequencibility of complete multi- $k$ -partite $k$ -graphs

Intersection theorems for families of matchings of complete $k$ -partite $k$ -graphs

The $r$ -matching sequencibility of complete graphs