Seunghun Lee (이승훈), On colorings of hypergraphs embeddable in
Room B332
IBS (기초과학연구원)
Given a hypergraph
10 events found.
Seminars and Colloquiums
Seunghun Lee (이승훈), On colorings of hypergraphs embeddable in
Room B332
IBS (기초과학연구원)
Hyunwoo Lee (이현우), Towards a high-dimensional Dirac’s theorem
Room B332 IBS (기초과학연구원)Dirac's theorem determines the sharp minimum degree threshold for graphs to contain perfect matchings and Hamiltonian cycles. There have been various attempts to generalize this theorem to hypergraphs with larger …
Ben Lund, Almost spanning distance trees in subsets of finite vector spaces
Room B332 IBS (기초과학연구원)For
Ting-Wei Chao (趙庭偉), Tight Bound on Joints Problem and Partial Shadow Problem
Room B332 IBS (기초과학연구원)Given a set of lines in
Shengtong Zhang (张盛桐), Triangle Ramsey numbers of complete graphs
Room B332 IBS (기초과학연구원)A graph is
Daniel McGinnis, Applications of the KKM theorem to problems in discrete geometry
Room B332 IBS (기초과학연구원)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 …
Jinyoung Park (박진영), Dedekind’s Problem and beyond
Room B332 IBS (기초과학연구원)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
Matthew Kroeker, Average flat-size in complex-representable matroids
Room B332 IBS (기초과학연구원)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 …
Zichao Dong, Convex polytopes in non-elongated point sets in
Room B332
IBS (기초과학연구원)
For any finite point set
Ander Lamaison, Uniform Turán density beyond 3-graphs
Room B332 IBS (기초과학연구원)The uniform Turán density