Casey Tompkins, Ramsey numbers of Boolean lattices
Room B232 IBS (기초과학연구원)The poset Ramsey number
The poset Ramsey number
What is the largest number
The independent domination number of a graph
We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) well-spread, …
Motivated from the surrounding property of a point set in
A geometric transversal to a family of convex sets in
For given
In a reduction sequence of a graph, vertices are successively identified until the graph has one vertex. At each step, when identifying
Erdős and Pósa proved in 1965 that there is a duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all …
An independent dominating set of a graph, also known as a maximal independent set, is a set