Pith. sign in

REVIEW

Maximum cliques in a graph without disjoint given subgraph

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2309.09603 v1 pith:VRQQSXXF submitted 2023-09-18 math.CO

Fangfang Zhang , Yaojun Chen , Ervin Gyori , Xiutao Zhu This is my paper · ORCID
classification math.CO
keywords graphcopiesdeterminedisjointexactmaximumnumbervalue
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

The generalized Tur\'an number $\ex(n,K_s,F)$ denotes the maximum number of copies of $K_s$ in an $n$-vertex $F$-free graph. Let $kF$ denote $k$ disjoint copies of $F$. Gerbner, Methuku and Vizer [DM, 2019, 3130-3141] gave a lower bound for $\ex(n,K_3,2C_5)$ and obtained the magnitude of $\ex(n, K_s, kK_r)$. In this paper, we determine the exact value of $\ex(n,K_3,2C_5)$ and described the unique extremal graph for large $n$. Moreover, we also determine the exact value of $\ex(n,K_r,(k+1)K_r)$ which generalizes some known results.

Discussion (0). Continue with ORCID to comment.

Pith tools