Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Cameron–Erdős_conjecture> ?p ?o. }
Showing items 1 to 16 of
16
with 100 items per page.
- Cameron–Erdős_conjecture abstract "In combinatorics, the Cameron–Erdős conjecture (now a theorem) is the statement that the number of sum-free sets contained in is The sum of two odd numbers is even, so a set of odd numbers is always sum-free. There are odd numbers in |N|, and so subsets of odd numbers in |N|. The Cameron–Erdős conjecture says that this counts a constant proportion of the sum-free sets.The conjecture was stated by Peter Cameron and Paul Erdős in 1988. It was proved by Ben Green and independently by Alexander Sapozhenko in 2003.".
- Cameron–Erdős_conjecture wikiPageID "13587617".
- Cameron–Erdős_conjecture wikiPageRevisionID "577097158".
- Cameron–Erdős_conjecture subject Category:Additive_number_theory.
- Cameron–Erdős_conjecture subject Category:Combinatorics.
- Cameron–Erdős_conjecture subject Category:Paul_Erdős.
- Cameron–Erdős_conjecture subject Category:Theorems_in_discrete_mathematics.
- Cameron–Erdős_conjecture comment "In combinatorics, the Cameron–Erdős conjecture (now a theorem) is the statement that the number of sum-free sets contained in is The sum of two odd numbers is even, so a set of odd numbers is always sum-free. There are odd numbers in |N|, and so subsets of odd numbers in |N|. The Cameron–Erdős conjecture says that this counts a constant proportion of the sum-free sets.The conjecture was stated by Peter Cameron and Paul Erdős in 1988.".
- Cameron–Erdős_conjecture label "Cameron–Erdős conjecture".
- Cameron–Erdős_conjecture label "Conjecture de Cameron-Erdős".
- Cameron–Erdős_conjecture label "Гипотеза Кэмерона — Эрдёша".
- Cameron–Erdős_conjecture sameAs Cameron%E2%80%93Erd%C5%91s_conjecture.
- Cameron–Erdős_conjecture sameAs Conjecture_de_Cameron-Erdős.
- Cameron–Erdős_conjecture sameAs Q2993308.
- Cameron–Erdős_conjecture sameAs Q2993308.
- Cameron–Erdős_conjecture wasDerivedFrom Cameron–Erdős_conjecture?oldid=577097158.