Pages that link to "Item:Q2346577"
From MaRDI portal
The following pages link to Lower bounds on the maximum number of non-crossing acyclic graphs (Q2346577):
Displaying 6 items.
- Lower bounds on the number of crossing-free subgraphs of \(K_N\) (Q1594599) (← links)
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
- A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← links)
- Lower bound for the size of maximal nontraceable graphs (Q2571275) (← links)
- Bounds on the maximum multiplicity of some common geometric graphs (Q2848539) (← links)
- Bounds on the maximum multiplicity of some common geometric graphs (Q3113726) (← links)