Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 479476

Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.

2 votes
1 answer
192 views

Partitioning the set of vertices of a convex n-gon into nonintersecting polygons

How can you prove that $$ \sum_{r=0}^{2k-2} (-1)^r \binom{2k-2}{r} (5k-2-r)^{2k-2} =(2k-2)! $$ This result I have obtained by comparing results of two different approaches for the partitioning of the …
Janaka Rodrigo's user avatar
0 votes
1 answer
240 views

Partitioning distinguishable objects into indistinguishable blocks

How can you partition n number of distinguishable objects into m number of indistinguishable blocks given that each of the blocks consists of not less than k number of objects. (k =1 case can be expla …
Janaka Rodrigo's user avatar
1 vote
0 answers
108 views

Different ways of partitioning a convex n -gon [closed]

What is the relationship between Catalan numbers and number of different ways of partitioning the set of vertices of a convex n-gon into nonintersecting polygons? Catalan numbers sequence describes nu …
Janaka Rodrigo's user avatar
4 votes
1 answer
322 views

Combinatorics related plane geometry

There are $n$ men, standing one at each vertex of a convex $n$-gon. If they are allowed to move together along sides or diagonals of the polygon to reach another vertex, how many different ways are th …
Janaka Rodrigo's user avatar