Ander Lamaison, Uniform Turán density beyond 3-graphs
The uniform Turán density $\pi_u(F)$ of a hypergraph $F$, introduced by Erdős and Sós, is the smallest value of $d$ such that any hypergraph $H$ where all linear-sized subsets of …
10 events found.
Discrete Math Seminar
Events
-
-
Room B332 IBS (기초과학연구원)
-
Sebastian Wiederrecht, Packing even directed circuits quarter-integrally
Room B332 IBS (기초과학연구원)We prove the existence of a computable function $f\colon\mathbb{N}\to\mathbb{N}$ such that for every integer $k$ and every digraph $D$ either contains a collection $\mathcal{C}$ of $k$ directed cycles of even …
-
Jie Han (韩杰), Perfect matchings in dense uniform hypergraphs
Room B332 IBS (기초과학연구원)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 …
-
-
Linda Cook, On polynomial degree-boundedness
Room B332 IBS (기초과학연구원)We prove a conjecture of Bonamy, Bousquet, Pilipczuk, Rzążewski, Thomassé, and Walczak, that for every graph $H$, there is a polynomial $p$ such that for every positive integer $s$, every …
-
Evangelos Protopapas, Erdős-Pósa Dualities for Minors
Room B332 IBS (기초과학연구원)Let $\mathcal{G}$ and $\mathcal{H}$ be minor-closed graphs classes. The class $\mathcal{H}$ has the Erdős-Pósa property in $\mathcal{G}$ if there is a function $f : \mathbb{N} \to \mathbb{N}$ such that every …
-
-
Casey Tompkins, On graphs without cycles of length 0 modulo 4
Room B332 IBS (기초과학연구원)Bollobás proved that for every $k$ and $\ell$ such that $k\mathbb{Z}+\ell$ contains an even number, an $n$-vertex graph containing no cycle of length $\ell \bmod k$ can contain at most …
-
Eero Räty, Positive discrepancy, MaxCut and eigenvalues of graphs
Room B332 IBS (기초과학연구원)The positive discrepancy of a graph $G$ of edge density $p$ is defined as the maximum of $e(U) - p|U|(|U|-1)/2$, where the maximum is taken over subsets of vertices in …
-
Magnus Wahlström, Algorithmic aspects of linear delta-matroids
Room B332 IBS (기초과학연구원)Delta-matroids are a generalization of matroids with connections to many parts of graph theory and combinatorics (such as matching theory and the structure of topological graph embeddings). Formally, a delta-matroid …
-
Víctor Dalmau, Right-adjoints of Datalog Programs
Room B332 IBS (기초과학연구원)We say that two functors Λ and Γ between thin categories of relational structures are adjoint if for all structures A and B, we have that Λ(A) maps homomorphically to …
-
Maximilian Gorsky, Towards the half-integral Erdős-Pósa property for even dicycles
Room B332 IBS (기초과학연구원)A family $\mathcal F$ of (di)graphs is said to have the half- or quarter-integral Erdős-Pósa property if, for any integer $k$ and any (di)graph $G$, there either exist $k$ copies …