Ruth Luo, Induced Turán problems for hypergraphs
Room B232 IBS (기초과학연구원)Let $F$ be a graph. We say that a hypergraph $\mathcal H$ is an induced Berge $F$ if there exists a bijective mapping $f$ from the edges of $F$ to the …
10 events found.
Seminars and Colloquiums
-
-
-
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 $C_4$-free graphs
Room 1401, Bldg. E6-1, KAISTGiven any integers $s,t\geq 2$, we show there exists some $c=c(s,t)>0$ such that any $K_{s,t}$-free graph with average degree $d$ contains a subdivision of a clique with at least $cd^{\frac{1}{2}\frac{s}{s-1}}$ …
-
Attila Joó, Base partition for finitary-cofinitary matroid families
Room B232 IBS (기초과학연구원)Let ${\mathcal{M} = (M_i \colon i\in K)}$ be a finite or infinite family consisting of finitary and cofinitary matroids on a common ground set $E$. We prove the following Cantor-Bernstein-type …
-
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 $Z_{2^n}$
Room B232 IBS (기초과학연구원)What is the largest subset of $Z_{2^n}$ that doesn't contain a projective d-cube? In the Boolean lattice, Sperner's, Erdos's, Kleitman's and Samotij's theorems state that families that do not contain …
-
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 …