Skip to search formSkip to main contentSkip to account menu

Extremal combinatorics

Known as: Extremal set theory 
Extremal combinatorics is a field of combinatorics, which is itself a part of mathematics. Extremal combinatorics studies how large or how small a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations

Broader (1)

Combinatorial optimization
Extremal graph theoryGraph (discrete mathematics)Penny Haxell

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Towards an Extremal Network Theory – Robust GDoF Gain of Transmitter Cooperation over TIN
We study the GDoF gain of transmitter cooperation (TC) over power control and treating interference as noise (TIN) for 3 regimes… 
2018
2018
Bollobás-type inequalities on set $k$-tuples
The Bollobas set pairs inequality is a fundamental result in extremal set theory. In this paper, we examine suitable conditions… 
2017
2017
Continuous optimisation in extremal combinatorics
In this thesis we explore instances in which tools from continuous optimisation can be used to solve problems in extremal graph… 
2017
2017
Construction of Binary Sensing Matrices Using Extremal Set Theory
The construction of binary sensing matrices is one of the active directions in the emerging field of compressed sensing (CS). Due… 
2016
2016
São Paulo School of Advanced Science on Algorithms , Combinatorics and Optimization The Perfect Matching Polytope , Solid Bricks and the Perfect Matching Lattice
e∈F x(e). M denotes the set of all perfect matchings of G. χ denotes the incidence vector of M . Cuts: A cut of G is a subset of… 
2014
2014
Trace Reconstruction Problem
In the setting of the trace reconstruction problem, a uniform random binary sequence w E {0, 1}' yields a collection of traces… 
Review
2013
Review
2013
Review of extremal combinatorics with applications to computer science (2nd edition) by Stasys Jukna
Review by Miklós Bóna The book is a collection of very short chapters, each of which is focused on one proof technique. It is a… 
2006
2006
The Normal Graph Conjecture is True for Circulants
Normal graphs are defined in terms of cross-intersecting set families and turned out to be “weaker” perfect graphs w.r.t. several… 
1998
1998
On partial clones containing all idempotent partial operations
Let k>2 and k be a k-element set. We show that though the partial clone I:=/spl cap//sub a/spl isin/k/pPol {a} of all idempotent… 
1987
1987
Problems in Finite Extremal Set Theory
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)