Loading...
Loading...

Go to the content (press return)

An improved lower bound on the maximum number of non-crossing spanning trees

Author
Huemer, C.; De Mier, A.
Type of activity
Presentation of work at congresses
Name of edition
Seventh European Conference on Combinatorics, Graph Theory and Applications
Date of publication
2013
Presentation's date
2013-09
First page
283
Last page
290
URL
http://cataleg.upc.edu/record=b1431828~S1*cat Open in new window
Group of research
DCG - Discrete and Combinatorial Geometry
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants