Cameron–Erdős conjecture/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Jitse Niesen (start) |
No edit summary |
||
| Line 13: | Line 13: | ||
{{r|Paul Erdős}} | {{r|Paul Erdős}} | ||
{{r|Ben Green}} | {{r|Ben Green}} | ||
==Articles related by keyphrases (Bot populated)== | |||
{{r|Inclusion-exclusion principle}} | |||
{{r|Cameron-Erdos conjecture}} | |||
{{r|Erdős number}} | |||
Latest revision as of 11:00, 24 July 2024
- See also changes related to Cameron–Erdős conjecture, or pages that link to Cameron–Erdős conjecture or to this page or whose text contains "Cameron–Erdős conjecture".
Parent topics
- Combinatorics [r]: Branch of mathematics concerning itself, at the elementary level, with counting things. [e]
- Sum-free set [r]: Add brief definition or description
- Peter Cameron [r]: Add brief definition or description
- Paul Erdős [r]: Add brief definition or description
- Ben Green [r]: Add brief definition or description
- Inclusion-exclusion principle [r]: Principle that, if A and B are finite sets, the number of elements in the union of A and B can be obtained by adding the number of elements in A to the number of elements in B, and then subtracting from this sum the number of elements in the intersection of A and B. [e]
- Cameron-Erdos conjecture [r]: Add brief definition or description
- Erdős number [r]: Named for the Hungarian-American mathematician Paul Erdős and are an application of graph theory, a field in which he published extensively. [e]