Results 181 to 190 of about 934 (196)
Some of the next articles are maybe not open access.
Extremal Combinatorics in Geometry and Graph Theory
2013We study a problem in extremal geometry posed by Paul Erdos and George Szekeres in 1935. This problem is to find the smallest positive integer N(n) such that every point set in general position (no three on a line) of N(n) points contains the vertex set of a convex n-gon.
openaire +1 more source
Spectral Methods in Extremal Combinatorics.
Extremal combinatorics studies how large a collection of objects can be if it satisfies a given set of restrictions. Inspired by a classical theorem due to Erdos, Ko and Rado, Simonovits and Sos posed the following problem: determine how large a collection of graphs on the vertex set {1,.,n} can be, if the intersection of any two of them contains a ...openaire +1 more source
Refuting conjectures in extremal combinatorics via linear programming
Journal of Combinatorial Theory - Series A, 2020Adam Zsolt Wagner
exaly
Universal limit theorems in graph coloring problems with connections to extremal combinatorics
Annals of Applied Probability, 2017Bhaswar B Bhattacharya, Sumit Mukherjee
exaly
Short proofs of some extremal results II
Journal of Combinatorial Theory Series B, 2016David Conlon +2 more
exaly
On the extremal cactus graphs for variable sum exdeg index with a fixed number of cycles
AKCE International Journal of Graphs and Combinatorics, 2020Akbar Ali +2 more
exaly
Recent Developments in Extremal Combinatorics: Ramsey and Turán Type Problems
2011Benny Sudakov
exaly