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 37708

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
144 views

Family of sets with unique subsets

I am given a set $M\subseteq\{1,\dots,n\},\,|M|=m$ and a famliy of $k$-sets ($k<m$) $\mathcal{U}=\{U_1,\dots,U_p\},\,U_{i}\subset M$. For this family, I would like to check one of the following condit …
Richard's user avatar
  • 243
1 vote
0 answers
66 views

Perfect Matchings in Biclique Decompositions of Multigraphs

Suppose you have the $K_{2n}$ covered by a multigraph consisting of $2n-1$ bicliques, each consisting of a partition of the vertex set into two sets of equal size. Here is a picture of $K_{6}$ with 5 …
Richard's user avatar
  • 243
2 votes
1 answer
83 views

Birkhoff Lattice of a forest

In my research, I stumbled upon a particular kind of poset and I was wondering, whether there is something in the literature (I could not find anything so far). They are distributive lattice $L$ suc …
Richard's user avatar
  • 243
3 votes
1 answer
199 views

Matching in the Boolean Algebra

We consider the Boolean Algebra of the set $[n]=\{1,\dots,n\}$ and the matching $\psi$ from the $m+1$ subsets of $[n]$ into the $m$ subsets of $[n]$ for $(n+1)/2\leq m+1\leq n$, which is used to show …
Richard's user avatar
  • 243
2 votes

Matching in the Boolean Algebra

One can understand the image of $\psi$ or $\psi|_M$ in terms of the inverse map $\phi$. $\phi$ maps an $m$ set to an $(m+1)$ set (if possible) in the following way. If $$A=\{i_1,\dots,i_m\}$$ is our …
Richard's user avatar
  • 243