Talk:Kruskal–Katona theorem

From Wikipedia, the free encyclopedia

[edit] Questions

Two things:

I believe the proper ordering to take is the colexicographical ordering.

Second, I don't understand the connection between the statement of the theorem, and the decomposition of m and subsequently |\partial(A)| into the sum of binomial coefficients. Could this be expanded on?

129.93.181.33 17:57, 13 June 2006 (UTC)Josh Brown Kramer

I think you're right about it needing to be colex, but I wasn't positive. And, IIRC, the reason we want to write it that way is because it lets us bound the size of |\partial A|. Don't quote me on it. I'm pretty sure there's a section on this in Brualdi's book on combinatorics, which I have, so I'll check it later and see if I can learn enough to modify the article to be clearer. Sopoforic 14:42, 16 June 2006 (UTC)