Jump to content

Talk:Frequency partition of a graph

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Tangi-tamma (talk | contribs) at 13:36, 20 April 2008 (→Simple graph etc.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Errors ? Keep this

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)[reply]

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)[reply]

Simple graph etc.

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)[reply]

I suggest to add simple examples to cover the graphs referred in reference section

Until then this artcle will treated as incomplete.

--Tangi-tamma (talk) 13:36, 20 April 2008 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Frequency_partition_of_a_graph&oldid=206881773"