Results 261 to 270 of about 390,323 (304)
The lower bound on independence number
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zang, W, Li, Y, Rousseau, CC
openaire +5 more sources
Independence number and clique minors
AbstractThe Hadwiger number ${h}({G})$ of a graph G is the maximum integer t such that ${K}_{t}$ is a minor of G. Since $\chi({G})\cdot\alpha({G})\geq |{G}|$, Hadwiger's conjecture implies that ${h}({G})\cdot \alpha({G})\geq |{G}|$, where $\alpha({G})$ and $|{G}|$ denote the independence number and the number of vertices of G, respectively.
Kawarabayashi, Ken Ichi, Song, Zi Xia
openaire +3 more sources
Perceptions of auditor independence: U.K. evidence [PDF]
The reality and perception of auditor independence is fundamental to public confidence in financial reporting. A new Independence Standards Board was set up in the U.S.
Vivien Beattie +2 more
exaly +2 more sources

