Layered subgraphs of the hypercube
arxiv(2024)
摘要
A subgraph of the n-dimensional hypercube is called 'layered' if it is a
subgraph of a layer of some hypercube. In this paper we show that there exist
subgraphs of the cube of arbitrarily large girth that are not layered. This
answers a question of Axenovich, Martin and Winter. Perhaps surprisingly, these
subgraphs may even be taken to be induced.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要