REVIEW 1 cited by
Extremal results for graphs avoiding a rainbow subgraph
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
Signed reviews
abstract
We say that $k$ graphs $G_1,G_2,\dots,G_k$ on a common vertex set of size $n$ contain a rainbow copy of a graph $H$ if their union contains a copy of $H$ with each edge belonging to a distinct $G_i$. We provide a counterexample to a conjecture of Frankl on the maximum product of the sizes of the edge sets of three graphs avoiding a rainbow triangle. We propose an alternative conjecture, which we prove under the additional assumption that the union of the three graphs is complete. Furthermore, we determine the maximum product of the sizes of the edge sets of three graphs or four graphs avoiding a rainbow path of length three.
Forward citations
Cited by 1 Pith paper
-
Hypergraph Tur\'an problem of the generalized triangle with bounded matching number
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).
Discussion (0). Continue with ORCID to comment.