Casey Tompkins, Inverse Turán Problems
Room B232 IBS (기초과학연구원)For given graphs $G$ and $F$, the Turán number $ex(G,F)$ is defined to be the maximum number of edges in an $F$-free subgraph of $G$. Briggs and Cox introduced a …
기초과학연구원 이산수학그룹
기초과학연구원 이산수학그룹
For given graphs $G$ and $F$, the Turán number $ex(G,F)$ is defined to be the maximum number of edges in an $F$-free subgraph of $G$. Briggs and Cox introduced a …