Pith. sign in

REVIEW

The inducibility of oriented stars

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.05430 v1 pith:TOCYMIML submitted 2020-08-12 math.CO

The inducibility of oriented stars

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

We consider the problem of maximizing the number of induced copies of an oriented star $S_{k,\ell}$ in digraphs of given size, where the center of the star has out-degree $k$ and in-degree $\ell$. The case $k\ell=0$ was solved by Huang. Here, we asymptotically solve it for all other oriented stars with at least seven vertices.

discussion (0)

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