Name for a graph invariant: minimal positive integer $d$ such that the graph is $d$-biclique-free
Consider this:
A class of graphs $C$ is said to be $d$-biclique-free, for some $d > 0$, if $K_{d,d}$ is not a subgraph of any $G \in C$
Source: https://arxiv.org/abs/1502.04803
Seems like the definition implies a graph invariant, the minimum $d$ for which a graph is $d$-biclique-free. I'd like a name for this property.
The context is that I'm collecting a (partly) machine-readable collection of graph invariants. Basically I want to associate each well-known and important graph property or class of graphs with:
-
a machine-readable name (identifier in a programming language)
-
a collection of alternative names
-
a very short description in natural language
-
other data points
I do not want to make up a name (myself), as the end-result will ideally be used by other people. I would be happy if someone knows a name for this property that is already used in published work. If not that, perhaps a made up name would be fine, too, as long as someone else does it. If so, hopefully the name catches on.
I was not able to find an answer by searching ISGCI. I suppose there's no info on biclique-free graphs there.
1 comment thread