Results 161 to 170 of about 934 (196)
Extremal Combinatorics of Reaction Systems
Lecture Notes in Computer Science, 2014 Extremal 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.
Alberto Dennunzio +2 more
exaly +5 more sources
Fully Computer-Assisted Proofs in Extremal Combinatorics
Proceedings of the AAAI Conference on Artificial Intelligence, 2023 We present a fully computer-assisted proof system for solving a particular family of problems in Extremal Combinatorics. Existing techniques using Flag Algebras have proven powerful in the past, but have so far lacked a computational counterpart to derive matching constructive bounds.
Olaf Parczyk +3 more
openaire +2 more sources
New results in extremal combinatorics
, 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.
Wong, Ching
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An Experimental Evaluation of a Function in Extremal Combinatorics
2021 International Conference on Computational Science and Computational Intelligence (CSCI), 2021Kai Wang, Hong Zhang
exaly +2 more sources
Problems and results in extremal combinatorics—I
Discrete Mathematics, 2003 Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoretical Computer Science, Geometry and Game Theory.
Noga Alon
exaly +1 more source
Algebraic, Extremal and Metric Combinatorics 1986
1988This 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.
exaly +2 more sources
On a Bound in Extremal Combinatorics
Doklady Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raigorodskii, A. M., Sagdeev, A. A.
openaire +1 more source