Mathematics
Edge
100%
Induced Subgraph
89%
Chromatic Number
57%
Free Graph
53%
Planar Graph
42%
Clique
41%
Polynomial Time
37%
Polynomial
36%
Integer
26%
Stable Set
26%
Cardinality
25%
Bipartite Graph
20%
clique number ω
17%
Counterexample
14%
Robertson
13%
Line Graph
13%
Complete Graph
12%
Hypergraphs
11%
Finite Graph
10%
Maximum Degree
10%
Branch-width
8%
Connected Graph
8%
Vertex of a Graph
8%
Tree Structure
8%
Four Color Theorem
8%
Matrix (Mathematics)
7%
Infinite Set
7%
Min-Cut
7%
Triangle
7%
Main Result
7%
Path Problem
6%
Maximal Clique
6%
Submatrix
6%
Connected Component
6%
Infinite Cardinal
6%
Complete Multipartite Graph
6%
Simple Graph
5%
Disjoint Subset
5%
Pairwise Disjoint
5%
Bounded Number
5%
Open Question
5%
Directed Path
5%
Binary Tree
5%
Spanning Tree
5%
degree sequence π
5%
Representativeness
5%
Necessary Condition
5%
Null-Homotopic
5%
Prism
5%
Planarity
5%
Polygon
5%
Disjoint Set
5%
Distinct Value
5%
Decomposition Theorem
5%
Keyphrases
Induced Subgraph
59%
Chromatic number
42%
Graph Minors
30%
Polynomial-time Algorithm
23%
Induced Cycle
18%
Odd Hole
18%
Pure Pair
17%
Stable Set
16%
Hypergraph
13%
Claw-free Graph
13%
Graph Theory
12%
Polynomial Bounds
12%
Disjoint Paths
12%
Clique number
11%
Disjoint
11%
Bipartite Graph
10%
Cardinality
10%
Planar Graph
10%
Petersen Graph
10%
Digraph
8%
Well-quasi-ordering
8%
Cubic Graph
8%
Vertex-disjoint Paths
8%
Induced Path
8%
Fractional Packing
8%
Treewidth
7%
Clique Set
7%
Path Graph
7%
Cutwidth
7%
Even-hole-free Graphs
7%
Local Graph
7%
Local Pooling
7%
Maximal Scheduling
7%
Complete Graph
7%
Directed Circuit
7%
Even Hole
7%
Maximum Degree
7%
Wagner Conjecture
7%
Infinite Sets
7%
Matroid
7%
Vertex-disjoint
6%
Claw-free
6%
Vertex Set
6%
Edge-disjoint
6%
Erdos
6%
Simple Graph
6%
Complete Description
6%
Hadwiger's Conjecture
6%
Tree Decomposition
5%
Odd Length
5%
Complete Bipartite Graph
5%
Complete Binary Tree
5%
Forbidden Minor
5%
Spanning Tree
5%
Packing Problem
5%
Simplicial Clique
5%
Hilbert-type Inequality
5%
H-free Graph
5%
Degree Sequence
5%
Small Bandwidth
5%
Container Method
5%
Edge Coloring
5%
Minimum Degree
5%
Planar Triangulation
5%
Tree Well
5%
Matroid Minor
5%
Least Time
5%
Homotopic
5%
Branchwidth
5%
Robber
5%
Pfaffian Orientation
5%
Graph Embedding
5%
Infinite Cardinal
5%
Total Flow
5%
Quality Characterization
5%
Menger's Theorem
5%
Decomposition Theorem
5%
