Results 161 to 170 of about 887,803 (201)
ABSTRACT GRAPH THEORY, EXTREMAL COMBINATORICS AND APPLICATIONS
, 2015 Andrea Jimenez-Ramirez
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On a Bound in Extremal Combinatorics
Doklady Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Raigorodskii, A. Sagdeev
semanticscholar +3 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 +2 more sources
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.
Christopher Cox
semanticscholar +2 more sources
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
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
Multiplayer Parallel Repetition Is the Same as High-Dimensional Extremal Combinatorics
arXiv.orgWe show equivalences between several high-dimensional problems in extremal combinatorics and parallel repetition of multiplayer (multiprover) games over large answer alphabets.
Kunal Mittal
semanticscholar +1 more source