@Article{Huang2019,
author = {Hao Huang},
date = {2019-07-01},
title = {Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture},
eprint = {1907.00847v2},
eprintclass = {math.CO},
eprinttype = {arXiv},
abstract = {In this paper, we show that every $(2^{n-1}+1)$-vertex induced subgraph of the $n$-dimensional cube graph has maximum degree at least $\sqrt{n}$. This result is best possible, and improves a logarithmic lower bound shown by Chung, F\"uredi, Graham and Seymour in 1988. As a direct consequence, we prove that the sensitivity and degree of a boolean function are polynomially related, solving an outstanding foundational problem in theoretical computer science, the Sensitivity Conjecture of Nisan and Szegedy.},
file = {:http\://arxiv.org/pdf/1907.00847v2:PDF},
keywords = {math.CO, cs.CC},
}
编译环境
宏包版本:gbt7714 v1.0 标注样式:super / numbers / authoryear
描述问题
在使用 biblatex 宏包,引用 arXiv 上的文献时,由于缺少 journal 这个域,使得逗号和句号紧挨着,所以能不能删除其中的逗号?
bib 数据库代码:
截图: