Extremal graph theory seeks to determine the maximum or minimum values of graph invariants—such as edge count, degree sequence or subgraph density—subject to the exclusion of particular configurations ...
Researchers have proved a special case of the Erdős-Hajnal conjecture, which shows what happens in graphs that exclude anything resembling a pentagon. When you walk into a room full of people, you can ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results