bipartite number

Definition: Bipartite number of $G$ is the maximum order of an induced bipartite subgraph.

Relations

Other		Relation from	Relation to
acyclic chromatic number	cyan■	unknown to HOPS	exclusion
arboricity	cyan■	unknown to HOPS	exclusion
average degree	cyan■	unknown to HOPS	exclusion
average distance	lime■	upper bound	unknown to HOPS
bandwidth	cyan■	unknown to HOPS	exclusion
bipartite	cyan■	unknown to HOPS	exclusion
bipartite number	yellow■	equal	equal
bisection bandwidth	cyan■	unknown to HOPS	exclusion
block	cyan■	unknown to HOPS	exclusion
book thickness	cyan■	unknown to HOPS	exclusion
boolean width	cyan■	unknown to HOPS	exclusion
bounded components	green■	upper bound	exclusion
boxicity	cyan■	unknown to HOPS	exclusion
branch width	cyan■	unknown to HOPS	exclusion
c-closure	cyan■	unknown to HOPS	exclusion
carving-width	cyan■	unknown to HOPS	exclusion
chordal	cyan■	unknown to HOPS	exclusion
chordality	cyan■	unknown to HOPS	exclusion
chromatic number	cyan■	unknown to HOPS	exclusion
clique cover number	green■	upper bound	exclusion
clique-tree-width	cyan■	unknown to HOPS	exclusion
clique-width	cyan■	unknown to HOPS	exclusion
cluster	green■	upper bound	exclusion
co-cluster	green■	upper bound	exclusion
cograph	green■	upper bound	exclusion
complete	green■	upper bound	exclusion
connected	cyan■	unknown to HOPS	exclusion
contraction complexity	cyan■	unknown to HOPS	exclusion
cutwidth	cyan■	unknown to HOPS	exclusion
cycle	cyan■	unknown to HOPS	exclusion
cycles	cyan■	unknown to HOPS	exclusion
d-path-free	green■	upper bound	exclusion
degeneracy	cyan■	unknown to HOPS	exclusion
degree treewidth	cyan■	unknown to HOPS	exclusion
diameter	green■	upper bound	exclusion
diameter+max degree	green■	upper bound	exclusion
disconnected	cyan■	unknown to HOPS	exclusion
disjoint cycles	cyan■	unknown to HOPS	exclusion
distance to bipartite	cyan■	unknown to HOPS	exclusion
distance to block	cyan■	unknown to HOPS	exclusion
distance to bounded components	green■	upper bound	exclusion
distance to chordal	cyan■	unknown to HOPS	exclusion
distance to cluster	green■	upper bound	exclusion
distance to co-cluster	green■	upper bound	exclusion
distance to cograph	green■	upper bound	exclusion
distance to complete	green■	upper bound	exclusion
distance to disconnected	cyan■	unknown to HOPS	exclusion
distance to edgeless	green■	upper bound	exclusion
distance to forest	cyan■	unknown to HOPS	exclusion
distance to interval	cyan■	unknown to HOPS	exclusion
distance to linear forest	cyan■	unknown to HOPS	exclusion
distance to maximum degree	cyan■	unknown to HOPS	exclusion
distance to outerplanar	cyan■	unknown to HOPS	exclusion
distance to perfect	cyan■	unknown to HOPS	exclusion
distance to planar	cyan■	unknown to HOPS	exclusion
distance to stars	green■	upper bound	exclusion
domatic number	cyan■	unknown to HOPS	exclusion
domination number	green■	upper bound	exclusion
edge clique cover number	green■	upper bound	exclusion
edge connectivity	cyan■	unknown to HOPS	exclusion
edgeless	green■	upper bound	exclusion
feedback edge set	cyan■	unknown to HOPS	exclusion
feedback vertex set	cyan■	unknown to HOPS	exclusion
forest	cyan■	unknown to HOPS	exclusion
genus	cyan■	unknown to HOPS	exclusion
girth	gray■	unknown to HOPS	unknown to HOPS
grid	cyan■	unknown to HOPS	exclusion
h-index	cyan■	unknown to HOPS	exclusion
inf-flip-width	cyan■	unknown to HOPS	exclusion
interval	cyan■	unknown to HOPS	exclusion
iterated type partitions	green■	upper bound	exclusion
linear clique-width	cyan■	unknown to HOPS	exclusion
linear forest	cyan■	unknown to HOPS	exclusion
linear NLC-width	cyan■	unknown to HOPS	exclusion
linear rank-width	cyan■	unknown to HOPS	exclusion
maximum clique	cyan■	unknown to HOPS	exclusion
maximum degree	cyan■	unknown to HOPS	exclusion
maximum independent set	green■	upper bound	exclusion
maximum induced matching	green■	upper bound	exclusion
maximum leaf number	cyan■	unknown to HOPS	exclusion
maximum matching	green■	upper bound	exclusion
maximum matching on bipartite graphs	green■	upper bound	exclusion
mim-width	gray■	unknown to HOPS	unknown to HOPS
minimum degree	cyan■	unknown to HOPS	exclusion
mm-width	cyan■	unknown to HOPS	exclusion
modular-width	green■	upper bound	exclusion
module-width	cyan■	unknown to HOPS	exclusion
neighborhood diversity	green■	upper bound	exclusion
NLC-width	cyan■	unknown to HOPS	exclusion
NLCT-width	cyan■	unknown to HOPS	exclusion
odd cycle transversal	cyan■	unknown to HOPS	exclusion
outerplanar	cyan■	unknown to HOPS	exclusion
path	cyan■	unknown to HOPS	exclusion
pathwidth	cyan■	unknown to HOPS	exclusion
pathwidth+maxdegree	cyan■	unknown to HOPS	exclusion
perfect	cyan■	unknown to HOPS	exclusion
planar	cyan■	unknown to HOPS	exclusion
radius-r flip-width	gray■	unknown to HOPS	unknown to HOPS
rank-width	cyan■	unknown to HOPS	exclusion
shrub-depth	cyan■	unknown to HOPS	exclusion
sim-width	gray■	unknown to HOPS	unknown to HOPS
size	green■	upper bound	exclusion
star	green■	upper bound	exclusion
stars	green■	upper bound	exclusion
topological bandwidth	cyan■	unknown to HOPS	exclusion
tree	cyan■	unknown to HOPS	exclusion
tree-independence number	gray■	unknown to HOPS	unknown to HOPS
treedepth	green■	upper bound	exclusion
treelength	gray■	unknown to HOPS	unknown to HOPS
treewidth	cyan■	unknown to HOPS	exclusion
twin-cover number	green■	upper bound	exclusion
twin-width	cyan■	unknown to HOPS	exclusion
vertex connectivity	cyan■	unknown to HOPS	exclusion
vertex cover	green■	upper bound	exclusion
vertex integrity	green■	upper bound	exclusion

Results

2008 Spanning Trees with Many Leaves and Average Distance by DeLaViña, Waller
- page 5 : average distance upper bounds bipartite number by a linear function – Theorem 9 (Main Theorem). Let $G$ be a graph. Then $\bar{D} < \frac b2 + \frac 12$. …
assumed
- maximum independent set upper bounds bipartite number by a linear function – folklore
- bipartite number is equivalent to bipartite number – assumed