Talk:Frequency partition of a graph
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Errors ? Keep this edit
- Okay, no answer after several days, so I am going to assume that a frequency partition is an unordered list, and edit the article myself to give a definition. References also need converting to in-line reference format, and the whole thing can be trimmed down a bit. Gandalf61 (talk) 16:15, 24 March 2008 (UTC)
I did not know that you were waiting on me. It is good that you connected FP to number theory - I liked it.
Would you like add what is "Potentially " or "Forcibly" degree sequences to Degree (Graph) sequencnces?
Also for you info - the FP of Bipartite graphs is unsolved. May be solved for Forcibly class.
--Tangi-tamma (talk) 22:07, 25 March 2008 (UTC)
Simple graph etc. edit
Called graphs as simple graphs to avoid confusion. The article is for simple graphs only. Likewise for k-uniform hypergraphs. Hope this helps. The case for other than simple graphs is trivial.
--Tangi-tamma (talk) 22:09, 19 April 2008 (UTC)
I suggest to add simple examples to cover the graphs referred in reference section edit
Until then this artcle will be treated as incomplete.
If someone writes the graph of the graphic degree sequence given in the article, we may attach it in the article. I could not use the fractions and floor functions to write the expressions. Someone may look into it.
--Tangi-tamma (talk) 13:36, 20 April 2008 (UTC) --Tangi-tamma (talk) 01:55, 21 April 2008 (UTC)