Results 161 to 170 of about 1,006,332 (204)
Some of the next articles are maybe not open access.
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
Substructure Densities in Extremal Combinatorics
, 2021One of the primary goals of combinatorial mathematics is to understand how an object's properties are influenced by the presence or multiplicity of a given substructure. Over time, it has become popular to highlight the asymptotic behaviour of objects by
Timothy F. N. Chan
semanticscholar +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.
Christopher Cox
semanticscholar +1 more source
Extremal combinatorics and universal algorithms
, 2018In this dissertation we solve several combinatorial problems in different areas of mathematics: automata theory, combinatorics of partially ordered sets and extremal combinatorics.
S. David
semanticscholar +1 more source
Continuous optimisation in extremal combinatorics
, 2017In 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
Matthew Jenssen
semanticscholar +1 more source
, 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 +1 more source
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 +1 more source
Structure and randomness in extremal combinatorics
, 2017In this thesis we prove several results in extremal combinatorics from areas including Ramsey theory, random graphs and graph saturation. We give a random graph analogue of the classical Andr´asfai, Erd˝os and S´os theorem showing that in some ways ...
Barnaby Roberts
semanticscholar +1 more source
Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics
, 2018I would like to thank Trinity College and Department of Pure Mathematics and Mathematical Statistics for their generous financial support and hospitality during PhD studies.
Luka Milićević
semanticscholar +1 more source
Local to Global Phenomenon and Other Topics in Probabilistic and Extremal Combinatorics
, 2021Matija Bucić
semanticscholar +1 more source