Alexander Clifton

activity

20172022

most citedContinuously Increasing Subsequences of Random Multiset Permutations

1 citations · 1 across the 3 of their papers we have counts for

collaborators

5 papers

math.CO2022

Reconstruction and Edge Reconstruction of Triangle-free Graphs

Alexander Clifton, Xiaonan Liu, Reem Mahmoud +1

The Reconstruction Conjecture due to Kelly and Ulam states that every graph with at least 3 vertices is uniquely determined by its multiset of subgraphs ${G - v : v \in V (G)}$ . Let $…

math.CO2022

Odd Covers of Graphs

Calum Buchanan, Alexander Clifton, Eric Culver +4

Given a finite simple graph $G$ , an odd cover of $G$ is a collection of complete bipartite graphs, or bicliques, in which each edge of $G$ appears in an odd number of bicliques and…

math.CO2021★ 1 cited

Continuously Increasing Subsequences of Random Multiset Permutations

Alexander Clifton, Bishal Deb, Yifeng Huang +2

For a word $π$ and integer $i$ , we define $L^{i} (π)$ to be the length of the longest subsequence of the form $i (i + 1) \dots j$ , and we let $L (π) := max_{i} L^{i} (π)$ . In this paper we esti…

math.CO2019

On almost k-covers of hypercubes

Alexander Clifton, Hao Huang

In this paper, we consider the following problem: what is the minimum number of affine hyperplanes in $R^{n}$ , such that all the vertices of $\{0, 1\}^n \setminus \{\vec{0}\…

math.CO2017

The canonical join complex for biclosed sets

Alexander Clifton, Peter Dillery, Alexander Garver

The canonical join complex of a semidistributive lattice is a simplicial complex whose faces are canonical join representations of elements of the semidistributive lattice. We give…