Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with extremal-graph-theory
Search options not deleted
user 492721
Study of graphs satisfying a property that are maximal or minimal with respect to some parameter. A classic example is Turán's Theorem, which exactly characterizes the densest graphs on $n$ vertices without a $K_t$ subgraph.
1
vote
1
answer
176
views
Gentle(-er) Introduction to Erdős–Bollobás's solution to Ramsey–Turán Type Problem
I am currently trying to understand the construction of maximal graph which contains no $K_4$ and sub-linear number of independent points in the graph. The original paper On a Ramsey–Turán type proble …
2
votes
Gentle(-er) Introduction to Erdős–Bollobás's solution to Ramsey–Turán Type Problem
I found an excellent account of this problem in the thesis of John Lenz: xtremal graph theory: Ramsey-Turán numbers, chromatic thresholds, and minors
Lenz, John E.