6 papers
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 abelian squares. We slightly extend this conjecture and show that it holds…
On the Hamiltonicity, traceability and toughness of complements of line graphs
Adam Mammoliti
A coline graph of a graph is the graph with vertex set for which two vertices and of are adjacent if and only if they are not adja…
Intersection theorems for families of matchings of complete -partite -graphs
Adam Mammoliti
The celebrated {ErdÅs-Ko-Rado} Theorem states that for a family of subsets of for which each pair of members of have a non-empty…
Zarankiewicz numbers near the triple system threshold
Guangzhou Chen, Daniel Horsley, Adam Mammoliti
For positive integers and , the Zarankiewicz number can be defined as the maximum total degree of a linear hypergraph with vertices and edges. Guy det…
Canonical labelling of Latin squares in average-case polynomial time
Michael J. Gill, Adam Mammoliti, Ian M. Wanless
A Latin square of order is an matrix in which each row and column contains each of symbols exactly once. For , we show that with high probability a unifor…
Exact values for unbalanced Zarankiewicz numbers
Guangzhou Chen, Daniel Horsley, Adam Mammoliti
For positive integers , , and , the Zarankiewicz number is defined to be the maximum number of edges in a bipartite graph with parts of sizes and $n…