Results 201 to 210 of about 997,897 (240)
Some of the next articles are maybe not open access.
, 2019
For much of this course, we will be studying graphs. Graphs are simple but fundamental mathematical objects, which can be used to model many real-world networks, for example the internet.
semanticscholar +2 more sources
For much of this course, we will be studying graphs. Graphs are simple but fundamental mathematical objects, which can be used to model many real-world networks, for example the internet.
semanticscholar +2 more sources
Intersecting families of permutations and other problems in extremal combinatorics
, 2010 This thesis is not available on this repository until the author agrees to make it public. If you are the author of this thesis and would like to make your work openly available, please contact us: thesis@repository.cam.ac.uk.
David Ellis
openalex +3 more sources
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk)
International Symposium on Mathematical Foundations of Computer Science, 2022We discuss recent algorithmic extensions of two classic results of extremal combinatorics about long paths in graphs. First, the theorem of Dirac from 1952 asserts that a 2-connected graph G with the minimum vertex degree d > 1, is either Hamiltonian or ...
F. Fomin +3 more
semanticscholar +1 more source
Extremal Combinatorics in Geometry and Graph Theory
, 2013 We 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.
Jonathan E. Beagley
openalex +2 more sources
An Experimental Evaluation of a Function in Extremal Combinatorics*
2021 International Conference on Computational Science and Computational Intelligence (CSCI), 2021We investigate the validity of a candidate formula for an extremal function introduced by Ferrara et al. The function is defined to be the minimum degree sum such that every bigraphic pair with a given number of terms in each part and at least this ...
Kai Wang, Hong Zhang
semanticscholar +1 more source
Extremal Combinatorics of Reaction Systems
2014Extremal combinatorics is the study of the size that a certain collection of objects must have in order to certainly satisfy a property. Reaction systems are a recent formalism for computation inspired by chemical reactions. This work is a first contribution to the study of the behaviour of large reaction systems by means of extremal combinatorics.
Dennunzio Alberto +2 more
openaire +3 more sources
Several problems in extremal combinatorics
2023In this thesis, we study several problems from combinatorial probability theory, discrete geometry and extremal graph theory. We establish several extremal results towards our problems. Some of the theorems extend or generalize previous results, and others resolve open problems in the literature.
openaire +1 more source
Extremal Results in and out of Additive Combinatorics
2020In this thesis, we study several related topics in extremal combinatorics, all tied together by various themes from additive combinatorics and combinatorial geometry. First, we discuss some extremal problems where local properties are used to derive global properties.
openaire +2 more sources
Applications of Continuous Combinatorics to Quasirandomness and Extremal Combinatorics
2021The theory of limits of dense combinatorial objects studies the asymptotic behavior of densities of small templates in an increasing sequence of combinatorial objects. The inaugural limit theory of graphons captures limits of graph sequences in a semantic limit object that can be thought of as a fractional version of an adjacency matrix. Since graphons
openaire +1 more source
Problems in Discrete Geometry and Extremal Combinatorics
2016We study several problems in discrete geometry and extremal combinatorics. Discrete geometry studies the combinatorial properties of finite sets of simple geometric objects. One theme of the field is geometric Ramsey theory. Given m geometric objects, we want to select a not too small subset forming a configuration that is “regular” in some sense.
openaire +2 more sources