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 erdos
Search options not deleted
user 8628
For questions related to the work of Paul Erdős, especially the many results and conjectures which bear his name.
5
votes
1
answer
372
views
Countable version of Erdös-Lovasz-Faber conjecture
Let $X$ be an infinite set, and let $(A_n)_{n\in\omega}$ be a collection of subsets of $X$ with the following properties:
$|A_m\cap A_n| \leq 1$ for $m\neq n\in \omega$, and
$|A_n|=\aleph_0$ for all …
- 48.9k
8
votes
Does there exist a comprehensive compilation of Erdos's open problems?
For graph theory problems, I find this the most comprehensive resource: http://www.math.ucsd.edu/~erdosproblems/
- 48.9k