Ruth Luo, Induced Turán problems for hypergraphs
Room B232 IBS (기초과학연구원)Let
10 events found.
Frédéric Meunier, Topological bounds for graph representations over any field
Room B232 IBS (기초과학연구원)Haviv (European Journal of Combinatorics, 2019) has recently proved that some topological lower bounds on the chromatic number of graphs are also lower bounds on their orthogonality dimension over $\mathbb …
Jakub Gajarský, First-order interpretations of bounded expansion classes
Room B232 IBS (기초과학연구원)The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter …
Hong Liu, A proof of Mader’s conjecture on large clique subdivisions in
Room 1401, Bldg. E6-1, KAIST
Given any integers
Attila Joó, Base partition for finitary-cofinitary matroid families
Room B232 IBS (기초과학연구원)Let
Jaiung Jun (전재웅), The Hall algebra of the category of matroids
Room 1401, Bldg. E6-1, KAISTTo an abelian category A satisfying certain finiteness conditions, one can associate an algebra H_A (the Hall algebra of A) which encodes the structures of the space of extensions between …
Sanjeeb Dash, Boolean decision rules via column generation
Room B232 IBS (기초과학연구원)In many applications of machine learning, interpretable or explainable models for binary classification, such as decision trees or decision lists, are preferred over potentially more accurate but less interpretable models …
Ben Lund, Furstenberg sets over finite fields
Room B232 IBS (기초과학연구원)An important family of incidence problems are discrete analogs of deep questions in geometric measure theory. Perhaps the most famous example of this is the finite field Kakeya conjecture, proved …
Adam Zsolt Wagner, The largest projective cube-free subsets of
Room B232
IBS (기초과학연구원)
What is the largest subset of
Dillon Mayhew, Courcelle’s Theorem for hypergraphs
Room B232 IBS (기초과학연구원)Courcelle's Theorem is an influential meta-theorem published in 1990. It tells us that a property of graph can be tested in polynomial time, as long as the property can expressed …