Pith. sign in

REVIEW

The structure of large non-trivial t-intersecting families for finite sets

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2008.10784 v2 pith:IJ7SRRBT submitted 2020-08-25 math.CO

The structure of large non-trivial t-intersecting families for finite sets

classification math.CO
keywords familiesfinitelargenon-trivialresultsetsstructurecase
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this paper, we describe the structure of maximal non-trivial uniform $t$-intersecting families with large size for finite sets. In the special case when $t=1$, our result gives rise to Kostochka and Mubayi's result in 2017.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.