Local and global average degree in bipartite graphs
Combinatorics
2026-07-15 v1
Abstract
Let denote the maximum, over all -vertex bipartite graphs without isolated vertices, of the ratio of the minimum local average degree to the global average degree. We prove that . This answers a problem posed by Tuza.
Cite
@article{arxiv.2607.14038,
title = {Local and global average degree in bipartite graphs},
author = {Jianfeng Hou and Hongbin Zhao},
journal= {arXiv preprint arXiv:2607.14038},
year = {2026}
}
Comments
9 pages