combinatorics / Graph invariants
Must every connected graph satisfy the proposed upper bound on its independence number in terms of residue and largest induced-bipartite-subgraph order? The family $\overline{K}_{2r+1} \vee (K_r \sqcup K_r)$ violates it for every $r \ge 3$.
Temporal state
No reconciled state yet.
Append-only history
Must every connected graph satisfy the proposed upper bound on its independence number in terms of residue and largest induced-bipartite-subgraph order? The family $\overline{K}_{2r+1} \vee (K_r \sqcup K_r)$ violates it for every $r \ge 3$.
Research memory
Must every connected graph satisfy the proposed upper bound on its independence number in terms of residue and largest induced-bipartite-subgraph order? The family $\overline{K}_{2r+1} \vee (K_r \sqcup K_r)$ violates it for every $r \ge 3$.
Evidence graph
No public relationships recorded yet.