2 papers
math.CO2024
Max-Bisections of graphs without perfect matching
Jianfeng Hou, Shufei Wu, Yuanyuan Zhong
A bisection of a graph is a bipartition of its vertex set such that the two resulting parts differ in size by at most 1, and its size is the number of edges that connect vertices i…
math.CO2023
Hypergraphs with irrational Turán density and many extremal configurations
Jianfeng Hou, Heng Li, Guanghui Wang +1
Unlike graphs, determining Turán densities of hypergraphs is known to be notoriously hard in general. The essential reason is that for many classical families of -uniform hyperg…