Results 11 to 20 of about 887,124 (211)
Two problems in extremal combinatorics
, 2021 In this thesis, we focus on two problems in extremal graph theory. Extremal graph theory consists of all problems related to optimizing parameters defined on graphs. The concept of ``editing'' appears in many key results and techniques in extremal graph theory, either as a means to account for error in structural results, or as a quantity to minimize ...
Alex Neal Riasanovsky
semanticscholar +7 more sources
Reaction systems and extremal combinatorics properties
Theoretical Computer Science, 2015 Extremal combinatorics is the study of the size that a collection of objects must have in order to certainly satisfy a given property. Reaction systems are a recent formalism for computation inspired by chemical reactions. This work is a first contribution to the study of the behavior of large reaction systems by means of extremal combinatorics.
Alberto Dennunzio +2 more
semanticscholar +6 more sources
Treewidth computation and extremal combinatorics [PDF]
Combinatorica, 2012 For a given graph G and integers b,f >= 0, let S be a subset of vertices of G of size b+1 such that the subgraph of G induced by S is connected and S can be separated from other vertices of G by removing f vertices. We prove that every graph on n vertices contains at most n\binom{b+f}{b} such vertex subsets.
Fedor V Fomin, Yngve Villanger
exaly +8 more sources
Preface: Levon Khachatrian’s legacy in extremal combinatorics
Discrete Applied Mathematics, 2016 Zoltán Füredi, Gyula O. H. Katona
semanticscholar +5 more sources
Probabilistic and extremal studies in additive combinatorics [PDF]
, 2022 The results in this thesis concern extremal and probabilistic topics in number theoretic settings. We prove sufficient conditions on when certain types of integer solutions to linear systems of equations in binomial random sets are distributed normally, results on the typical approximate structure of pairs of integer subsets with a given sumset ...
Maximilian Wötzel
openalex +5 more sources
Coloring and extremal problems in combinatorics
, 2010 Coloring problems concern partitions of structures. The classic problem of partitioning the set of integers into a finite number of pieces so that no one piece has an arithmetic progression of a fixed length was solved in 1927. Van der Waerden's Theorem shows that it is impossible to do so.
Jacob Manske
openalex +5 more sources
Extremal problems and the combinatorics of sumsets
, 2023 18 pages.
Melvyn B. Nathanson
openalex +4 more sources
Problems and results in extremal combinatorics—II [PDF]
Discrete Mathematics, 2007 Extremal Combinatorics is among the most active topics in Discrete Mathematics, dealing with problems that are often motivated by questions in other areas, including Theoretical Computer Science and Information Theory. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems ...
Noga Alon
openalex +6 more sources
Problems and results in extremal combinatorics—I
Discrete Mathematics, 2003 Noga Alon
exaly +2 more sources