#7301: Gale Ryser theorem
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: mhansen
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3
Component: combinatorics | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
-----------------------------+----------------------------------------------
Comment(by wdj):
Replying to [comment:4 ncohen]:
> I'm glad to hear it !! This is my second attempt at a contribution to
the Combinatorics section, and I hope you will find it useful :-)
>
> The odd thing is that if I knew of the Gale Ryser theorem, I never heard
of the theorem you are talking about, when it clearly should be the
opposite... Could you tell me what this theorem is about ? I was not able
to find it using "haval" on Google, and I am very interested in what it
could be :-)
>
> The only direct use I could make of this theorem in Graph Theory
> is deciding whether there exists a bipartite graph with a given
> degree sequence... Is that the result you are mentionning ? :-)
>
Yes, I believe that is it. But I think the Haval-??? Theorem generalizes
that a bit.
> And by the way, I only wrote this function for squares matrices when it
is not required.. Thinking about bipartite graphs helped me notice :-)
>
> Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7301#comment:5>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
