Search Results
| 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 co.combinatorics
Search options not deleted
user 22722
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
3
votes
1
answer
183
views
upper bound for the number of open discs containing k points in the plane
Hello,
I hope that you can help me with this.
Let P be a set of points in the plane, such that |p|=n, what is the maximal number of open discs containing atleast k points for some k, two discs are e …
- 393
3
votes
2
answers
2k
views
Vapnik-Chervonenkis dimension of lines in the plane
I'm having some problems with this problem concerning VC dimensions (http://en.wikipedia.org/wiki/VC_dimension), I hope for some helping input.
Given a set $L$ of $n$ lines in the plane, define a hyp …
- 393
2
votes
"Separated" version of Sauer's lemma on VC classes
The following paper by Haussler: http://www.sciencedirect.com/science/article/pii/0097316595900527.
Gives an appropriate upper bound for the case $\mathcal{A} \subset \Phi$.
Which results in $|\mathc …
- 393
0
votes
Accepted
upper bound for the number of open discs containing k points in the plane
Hmm, i think i have an idea, the number of distinct open discs containg atleast k points, for k>2 is bounded by ${n \choose 3}$, since every disc is uniquely defined by the 3 points contained in it an …
- 393