A bipartite version of the Erd\H{o}s $-$ McKay conjecture
arXiv (Cornell University)(2022)
摘要
An old conjecture of Erd\H{o}s and McKay states that if all homogeneous sets in an $n$-vertex graph are of order $O(\log n)$ then the graph contains induced subgraphs of each size from $\{0,1,\ldots, \Omega (n^2)\}$. We prove a bipartite analogue of the conjecture: if all balanced homogeneous sets in an $n \times n$ bipartite graph are of order $O(\log n)$ then the graph contains induced subgraphs of each size from $\{0,1,\ldots, \Omega (n^2)\}$.
更多查看译文
关键词
mckay,bipartite version
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要