Every bipartite graph is (1+ceil(m/2))-representable, improving to ceil(m/2) when the smaller part has odd size, settling the Glen et al. conjecture except for equal-even bipartitions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Conjecture of the Representation Number of Bipartite Graphs
Every bipartite graph is (1+ceil(m/2))-representable, improving to ceil(m/2) when the smaller part has odd size, settling the Glen et al. conjecture except for equal-even bipartitions.