Problems and results in extremal combinatorics—II
Copyright policy )Problems and results in extremal combinatorics—II
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 suggested by various researchers. The topics considered here include questions in Extremal Graph Theory, Coding Theory and Social Choice. This is by no means a comprehensive survey of the area, and is merely a collection of problems, results and proofs, which are hopefully interesting. As the title of the paper suggests, this is a sequel of three previous papers of the same flavour. Each section of this paper is essentially self contained, and can be read separately.
Combinatorial optimization, extremal graph theory, probabilistic combinatorics, Covering codes, Theoretical Computer Science, coupon collector, Extremal combinatorics, FOS: Mathematics, Research exposition (monographs, survey articles) pertaining to combinatorics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, survey, polyhedral combinatorics, Extremal problems in graph theory, Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming, Symmetric functions and generalizations, Combinatorial probability, Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory, Coupon collector, extremal problems, covering codes, Extremal Graph Theory, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Combinatorics (math.CO), 05C35
Combinatorial optimization, extremal graph theory, probabilistic combinatorics, Covering codes, Theoretical Computer Science, coupon collector, Extremal combinatorics, FOS: Mathematics, Research exposition (monographs, survey articles) pertaining to combinatorics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, survey, polyhedral combinatorics, Extremal problems in graph theory, Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming, Symmetric functions and generalizations, Combinatorial probability, Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory, Coupon collector, extremal problems, covering codes, Extremal Graph Theory, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Combinatorics (math.CO), 05C35
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).109 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!