Results 21 to 30 of about 995,571 (241)
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
openalex +7 more sources
Entropic Matroids and Their Representation [PDF]
Entropy, 2019 This paper investigates entropic matroids, that is, matroids whose rank function is given as the Shannon entropy of random variables. In particular, we consider p-entropic matroids, for which the random variables each have support of cardinality p.
Emmanuel Abbe, Sophie Spirkl
doaj +2 more sources
Optimal Probability Inequalities for Random Walks Related to Problems in Extremal Combinatorics [PDF]
SIAM Journal on Discrete Mathematics, 2012 Let S_n=X_1+...+X_n be a sum of independent symmetric random variables such that |X_{i}|\leq 1. Denote by W_n= _{1}+...+ _{n} a sum of independent random variables such that \prob{\eps_i = \pm 1} = 1/2. We prove that \mathbb{P}{S_{n} \in A} \leq \mathbb{P}{cW_k \in A}, where A is either an interval of the form [x, \infty) or just a single point.
Dainius Dzindzalieta +2 more
openalex +5 more sources
Extremal combinatorics and universal algorithms
, 2018 In 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 +3 more sources
On problems in Extremal Combinatorics
, 2016 Extremal Combinatorics studies how large or how small a structure can be, if it does not contain certain forbidden configuration. One of its major areas of study is extremal set theory, where the structures considered are families of sets, and the forbidden configurations are restricted intersection patterns.
M. Tran
semanticscholar +3 more sources
Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics
, 2018 I 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 +3 more sources
Problems in Extremal Combinatorics [PDF]
, 2012 This dissertation is divided into two major sections. Chapters 1 to 4 are concerned with Turán type problems for disconnected graphs and hypergraphs. In Chapter 5, we discuss an unrelated problem dealing with the equivalence of two notions of stationary ...
Bushaw, Neal Owen
core +2 more sources
PPP-Completeness and Extremal Combinatorics [PDF]
14thInnovationsinTheoreticalComputerScienceConference(ITCS2023), 2023 +4 more
core +2 more sources
Probabilistic models for the analysis of inverse extremal problems in combinatorics [PDF]
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2022 In an inverse extremal problem for a combinatorial scheme with a given value of the objective function of the form of a certain extreme value of its characteristic, a probabilistic model is developed that ensures that this value is obtained in its ...
Nataliya Yu. Enatskaya
doaj +1 more source