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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1980-2017
05101519802017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Extremal Combinatorics is one of the most active topics in Discrete Mathematics, dealing with problems that are often motivated… (More)
Is this relevant?
Review
2014
Review
2014
Extremal Combinatorics is one of the most active topics in Discrete Mathematics, dealing with problems that are often motivated… (More)
Is this relevant?
2012
2012
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
  • Stasys Jukna
  • Texts in Theoretical Computer Science. An EATCS…
  • 2011
If you get the printed book in on-line book store, you may also find the same problem. So, you must move store to store and… (More)
Is this relevant?
2009
2009
1 Bipartite forbidden subgraphs We have seen the Erdős-Stone theorem which says that given a forbidden subgraph H, the extremal… (More)
Is this relevant?
2008
2008
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… (More)
Is this relevant?
Review
2008
Review
2008
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by… (More)
Is this relevant?
2004
2004
It is hard to give a rigorous definition of Combinatorics, hence we start with a few examples illustrating the area. Testing… (More)
Is this relevant?
Review
2002
Review
2002
Extremal Combinatorics is an area in Discrete Mathematics that has developed spectacularly during the last decades. This paper… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We prove that every monotone circuit which tests <italic>st</italic>-connectivity of an undirected graph on <italic>n</italic… (More)
Is this relevant?