Extremal graph theory

Known as: Extremal graph 
Extremal graph theory is a branch of the mathematical field of graph theory. Extremal graph theory studies extremal (maximal or minimal) graphs which… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Given a family of graphs H, the extremal number ex(n,H) is the largest m for which there exists a graph with n vertices and m… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2017
Highly Cited
2017
  • Vincent Vascimini
  • 2017
 
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2017
2017
We study the uniqueness of optimal solutions to extremal graph theory problems. Our main result is a counterexample to the… (More)
  • figure 1
Is this relevant?
Review
2015
Review
2015
Extremal problems in graph theory form a very wide research area. We study the following topics: the metric dimension of… (More)
Is this relevant?
2008
2008
What you see below are notes related to a course that I have given several times in Extremal Graph Theory. I guarantee no… (More)
  • figure 3.1
  • figure 3.3
  • figure 3.5
  • figure 3.6
Is this relevant?
2007
2007
A set of vertices S resolves a connected graph G if every vertex is uniquely determined by its vector of distances to the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
G(?z; I) will denote a graph of n vertices and 1 edges. Let fO(lz, K) be the smallest integer such that there is a G (n; f,, (n… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Let L be a given family of so called prohibited graphs. Let ex (n, LL denote the maximum number of edges a simple graph of order… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1973
1973
Let L # Kp be a p-chromatic graph and e be an edge of L such that L e is (p 1)chromatic . If G n is a graph of n vertices without… (More)
  • figure 1
  • figure 2
Is this relevant?