Colin de Verdière graph invariant
graph property
Press Enter · cited answer in seconds
0 sources
Colin de Verdière graph invariant
Summary
Colin de Verdière graph invariant is a graph property[1]. It draws 10 Wikipedia views per month (graph_property category, ranking #21 of 43).[2]
Key Facts
- Colin de Verdière graph invariant's instance of is recorded as graph property[3].
- Yves Colin de Verdière is named after Colin de Verdière graph invariant[4].
- Colin de Verdière graph invariant's Freebase ID is recorded as /m/08t11v[5].
- Colin de Verdière graph invariant's defining formula is recorded as \mu(G)=\max_{M\in\mathcal M_G}\dim\ker M[6].
- Colin de Verdière graph invariant's studied by is recorded as graph theory[7].
- Colin de Verdière graph invariant's exact match is recorded as https://www.findstat.org/StatisticsDatabase/St000741/[8].
- Colin de Verdière graph invariant's less than is recorded as circumference[9].
- Colin de Verdière graph invariant's less than is recorded as crossing number[10].
- Colin de Verdière graph invariant's less than is recorded as number of vertices[11].
- Colin de Verdière graph invariant's less than is recorded as maximum nullity[12].
- Colin de Verdière graph invariant's less than is recorded as treewidth[13].
- Colin de Verdière graph invariant's less than is recorded as proper pathwidth[14].
- Colin de Verdière graph invariant's maintained by WikiProject is recorded as WikiProject Mathematics[15].
- Colin de Verdière graph invariant's in defining formula is recorded as \mu(G)[16].
- Colin de Verdière graph invariant's in defining formula is recorded as \dim\ker[17].
Why It Matters
Colin de Verdière graph invariant draws 10 Wikipedia views per month (graph_property category, ranking #21 of 43).[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[18] It is known by 10 alternative names across languages and contexts.[19]