Search arXivSearch

arXiv · 2511.10592

Two new results on maximal left-compressed intersecting families

Abstract

This paper presents two new results on the theory of maximal left-compressed intersecting families (MLCIFs). First, we answer a question raised by Barber by showing that the number of $k$-uniform MLCIFs on a ground set of size $n$ grows as a doubly-exponential function of $k$, which we identify up to a log factor in the exponent. Among these MLCIFs we identify $k$ specific MLCIFs -- which we call the canonical MLCIFs -- as being in a meaningful way the most important MLCIFs. Specifically, our second main result shows that the canonical MLCIFs are precisely those which can have maximum weight among all $k$-uniform MLCIFs under a non-trivial increasing weight function, and moreover that each canonical MLCIF is the unique $k$-uniform MLCIF of maximum weight for some increasing weight function. This gives an interesting generalisation of the Erdős--Ko--Rado theorem to a notion of size which places greater significance on some elements of the ground set than others.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Allan Flower, Richard Mycroft. 2025-11-13. Two new results on maximal left-compressed intersecting families. https://arxiv.org/abs/2511.10592

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO