Supersaturation problem for color-critical graphs
<p dir="ltr">The <i>Turán function</i> ex ( <i>n , F</i> ) of a graph F is the maximum number of edges in an F-free graph with n vertices. The classical results of Turán and Rademacher from 1941 led to the study of supersaturated graphs where the key question...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2017
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|