-
Notifications
You must be signed in to change notification settings - Fork 234
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Merged by Bors] - feat(Data/Finset/Card): the number of element satisfying P
is no greater than n
iff every subset with more than n
elements contains an element not satisfying P
#9048
Conversation
jjaassoonn
commented
Dec 14, 2023
P
is no greater than n
iff every subset with more than n
elements contains an element not satisfying P
`P
is no greater than n
iff every subset with more than n
elements contains an element not satisfying P
Co-authored-by: Junyan Xu <junyanxu.math@gmail.com>
Co-authored-by: Junyan Xu <junyanxu.math@gmail.com>
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
maintainer merge
🚀 Pull request has been placed on the maintainer queue by alreadydone. |
Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>
maintainer merge |
🚀 Pull request has been placed on the maintainer queue by alreadydone. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks 🎉
bors merge
…eater than `n` iff every subset with more than `n` elements contains an element not satisfying `P` (#9048)
Pull request successfully merged into master. Build succeeded: |
P
is no greater than n
iff every subset with more than n
elements contains an element not satisfying P
P
is no greater than n
iff every subset with more than n
elements contains an element not satisfying P