Ting-Wei Chao (趙庭偉), Tight Bound on Joints Problem and Partial Shadow Problem
Room B332 IBS (기초과학연구원)Given a set of lines in
Given a set of lines in
A graph is
We present the KKM theorem and a recent proof method utilizing it that has proven to be very useful for problems in discrete geometry. For example, the method was used …
The Dedekind's Problem asks the number of monotone Boolean functions, a(n), on n variables. Equivalently, a(n) is the number of antichains in the n-dimensional Boolean lattice
Melchior’s Inequality (1941) implies that, in a rank-3 real-representable matroid, the average number of points in a line is less than three. This was extended to the complex-representable matroids by …
For any finite point set
The uniform Turán density
We prove the existence of a computable function
There has been a raising interest on the study of perfect matchings in uniform hypergraphs in the past two decades, including extremal problems and their algorithmic versions. I will introduce …
We prove a conjecture of Bonamy, Bousquet, Pilipczuk, Rzążewski, Thomassé, and Walczak, that for every graph