Results 81 to 90 of about 13,803 (191)

Extremal combinatorics in generalized Kneser graphs

open access: yes, 2003
This thesis focuses on the interplay of extremal combinatorics and finite geometry. Combinatorics is concerned with discrete (and usually finite) objects. Extremal combinatorics studies how large or how small a collection of finite objects can be under certain restrictions. Those objects can be sets, graphs, vectors, etc.
openaire   +2 more sources

Continuous optimisation in extremal combinatoricst

open access: yes, 2017
In this thesis we explore instances in which tools from continuous optimisation can be used to solve problems in extremal graph and hypergraph theory. We begin by introducing a generalised notion of hypergraph Lagrangian and use tools from the theory of nonlinear optimisation to explore some of its properties.
openaire   +3 more sources

Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics

open access: yes, 2018
In this thesis, we consider several combinatorial topics, belonging to the areas appearing in the thesis title. Given a non-empty complete metric space $(X,d)$, a family of $n$ continuous maps $f_1,f_2,\dots,f_n\colon X\to X$ is a \emph{contractive family} if there exists $\lambda<1$ such that for any $x,y\in X$ we have $d(f_i(x),f_i(y))\leq\lambda ...
openaire   +2 more sources

Locally common graphs. [PDF]

open access: yesJ Graph Theory, 2023
Csóka E, Hubai T, Lovász L.
europepmc   +1 more source

Home - About - Disclaimer - Privacy