Results 171 to 180 of about 14,970 (213)
Algebraic, Extremal and Metric Combinatorics 1986
, 1988 This book represents a comprehensive overview of the present state of progress in three related areas of combinatorics. It comprises selected papers from a conference held at the University of Montreal. Topics covered in the articles include association schemes, extremal problems, combinatorial geometrics and matroids, and designs.
Michel Deza +3 more
openalex +3 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
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
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On a Bound in Extremal Combinatorics
Doklady Mathematics, 2018A new statement of a recent theorem of [1, 2] on the maximum number of edges in a hypergraph with forbidden cardinalities of edge intersections is given. This statement is fundamentally simpler than the original one, which makes it possible to obtain important corollaries in combinatorial geometry and Ramsey theory.
A. M. Raigorodskii +4 more
openaire +2 more sources
New results in extremal combinatorics [PDF]
, 2021 Extremal problems, in general, ask for the optimal size of certain finite objects when some restrictions are imposed. In extremal combinatorics, a major field in combinatorics, one studies how global properties guarantee the existence of local substructures, or equivalently, how avoiding local substructures poses a constraint on global quantities.
openaire +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 +4 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
Problems in Coding Theory and Extremal Combinatorics
2020This dissertation consists of ?five papers whose subjects are mostly disjoint. Below are their abstracts and citation information.On a fractional version of Haemers' bound. In this note, we present a fractional version of Haemers' bound on the Shannon capacity of a graph, which is originally due to Blasiak.
openaire +2 more sources
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