Abstract
A partition of an integer n is graphical if it is the degree sequence of a simple, undirected graph. It is an open question whether the fraction of partitions of n which are graphical approaches 0 as n approaches infinity. A partition π is basic if the number of dots in its Ferrers graph is minimum among all partitions with the same rank vector as π.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
