Jul 25, 2022 · Title:On weakly Turán-good graphs. Authors:Dániel Gerbner. View a PDF of the paper titled On weakly Tur\'an-good graphs, by D\'aniel Gerbner.
On weakly Turán-good graphs. Gerbner, Dániel. Abstract. Given graphs $H$ and $F$ with $\chi(H)<\chi(F)$, we say that $H$ is weakly $F$-Turán-good if among $n ...
Dec 30, 2022 · Let F be a 3-chromatic graph with a color-critical edge. Then H is weakly F-Turán-good. Considering the large variety of weakly Kr+1-Turán-good ...
On weakly Turán-good graphs · Dániel Gerbner · Published in Discussiones Mathematicae… 25 July 2022 · Mathematics.
Let us call a graph H weakly F-Turán-good if the number of copies of H is maximized by a complete multipartite graph among F-free graphs on n vertices, provided ...
Extremal problems for weakly quasirandom hypergraphs. Since in contrast to graphs, weakly quasirandom hypergraphs H may not contain every fixed hypergraph F it ...
Let us turn our attention to F -Turán-good graphs where F is not a clique. We show a weak version of the above results for this case. We say that an edge of a ...
People also ask
How do you find good graphs?
What graph is best for frequency distribution?
Recently, Gerbner and Palmer [9] obtained a similar result, which gives a new class of k-Turán-good graphs. ... On weakly Turán-good graphs. 2022, arXiv. View all ...
On a Turán problem in weakly quasirandom 3-uniform hypergraphs
ems.press › journals › jems › articles
On a Turán problem in weakly quasirandom 3-uniform hypergraphs. Christian Reiher. Universität Hamburg, Germany. Vojtěch Rödl.
Remark: Although our main result is weaker than Theorem 2, it would be interesting for researchers interested to weak Turán's Theo- rem. References. [1] N. Alon ...