Cameron–Erdős conjecture/Related Articles

From Citizendium
< Cameron–Erdős conjecture
Revision as of 11:00, 24 July 2024 by Suggestion Bot (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
A list of Citizendium articles, and planned articles, about Cameron–Erdős conjecture.
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]

Other related topics

Articles related by keyphrases (Bot populated)

  • 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]