Pith. sign in

REVIEW 2 cited by

Graphs without rainbow triangles

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 2203.07768 v1 pith:YMJALBFQ submitted 2022-03-15 math.CO

Peter Frankl This is my paper · ORCID
classification math.CO
keywords graphsconditionconsideredgesmaximumnumberproductrainbow
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Let F,G,H be three graphs on the same n vertices. We consider the maximum of the sum and product of the number of their edges subject to the condition in the title.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Hypergraph Tur\'an problem of the generalized triangle with bounded matching number

    math.CO 2025-07 conditional novelty 7.0 of 10

    For n≥30(s+1), every F5-free 3-graph with matching number at most s has at most s⌊(n−s)^2/4⌋ edges, with equality only for the complete 3-partite hypergraph H3(n,s).

  2. Rainbow Tur\'an problems for a matching and any other graph

    math.CO 2025-05 conditional novelty 6.0 of 10

    The paper determines extremal edge counts (minimum, sum, product) for rainbow graph collections avoiding both a fixed graph F and a matching of size s+1.

Pith tools