Keyphrases
2-cycles
24%
3-uniform Hypergraph
20%
Bender
10%
Best-possible Bound
10%
Bohman
10%
Bootstrap Percolation
20%
Chromatic number
5%
Connected Graph
20%
Dirac
24%
Edge Density
6%
Edge-to-edge
10%
Extra Assumption
10%
Frieze
10%
Hamilton Cycle
76%
Hamilton Cycle Problem
20%
High Probability
10%
Hypergraph
40%
Hypergraph Regularity
6%
Hypergraph Regularity Method
6%
Independence number
10%
Labeled Oriented Tree
10%
Maximum Degree
10%
Minimum Codegree
38%
Minimum Degree
28%
Minimum Vertex Degree
26%
Multipartite
20%
NP-hard
12%
Number of Vertices
5%
Oriented Tree
20%
Percolation Mechanism
20%
Perfect Triangle
20%
Perturbed Hypergraph
20%
Polynomial-time Algorithm
8%
Quasi-random
6%
Quasirandom Hypergraphs
20%
Quasirandomness
6%
Regularity Lemma
6%
Result State
10%
Tight
20%
Tight Cycle
20%
Uniform Hypergraph
80%
Vertex Degree
6%
Mathematics
Almost Perfect
5%
Analogous Result
6%
Asymptotics
20%
Chromatic Number
6%
Connected Graph
20%
Edge
18%
Hypergraphs
100%
Independence Number
5%
Independent Set
20%
Integer
6%
Main Result
10%
Maximum Degree
20%
Open Question
5%
Polynomial Time
6%
Probability Theory
13%
Sufficient Condition
20%
Triangle
20%