| http://dbpedia.org/ontology/abstract
|
En mathématiques, et plus précisément en c … En mathématiques, et plus précisément en combinatoire, la conjecture des familles stables par unions est un problème d'énoncé élémentaire posé par Péter Frankl en 1979 et toujours ouvert. Une famille d'ensembles est dite stable par unions si l'union de deux ensembles quelconque de la famille est encore dans la famille. La conjecture affirme que pour toute famille finie d'ensembles finis (non vides), stable par unions, il existe un élément appartenant à au moins la moitié des ensembles de la famille.ins la moitié des ensembles de la famille.
, Гипотеза Франкла — гипотеза в комбинаторике, известная как открытая задача с элементарной формулировкой.
, In combinatorics, the union-closed sets co … In combinatorics, the union-closed sets conjecture is a problem, posed by Péter Frankl in 1979 and is still open. A family of sets is said to be union-closed if the union of any two sets from the family belongs to the family. The conjecture states: For every finite union-closed family of sets, other than the family containing only the empty set, there exists an element that belongs to at least half of the sets in the family. Professor Timothy Gowers called this "one of the best known open problems in combinatorics" and said that the conjecture "feels as though it ought to be easy (and as a result has attracted a lot of false proofs over the years). A good way to understand why it isn't easy is to spend an afternoon trying to prove it. That clever averaging argument you had in mind doesn't work ..."argument you had in mind doesn't work ..."
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www.combinatorics.org/Volume_15/Abstracts/v15i1r88.html +
, https://twitter.com/wtgowers/status/1593157232543207424 +
, http://www.math.uiuc.edu/~west/openp/unionclos.html +
, http://ajc.maths.uq.edu.au/pdf/47/ajc_v47_p265.pdf +
, http://garden.irmacs.sfu.ca/%3Fq=op/frankls_union_closed_sets_conjecture +
, http://www.math.uiuc.edu/~west/openp/index.html +
, https://doi.org/10.1007/s00373-014-1515-0 +
|
| http://dbpedia.org/ontology/wikiPageID
|
4308458
|
| http://dbpedia.org/ontology/wikiPageLength
|
13446
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1124556017
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Boolean_algebra_%28structure%29 +
, http://dbpedia.org/resource/Singleton_%28mathematics%29 +
, http://dbpedia.org/resource/Graphs_and_Combinatorics +
, http://dbpedia.org/resource/Degree_%28graph_theory%29 +
, http://dbpedia.org/resource/Category:Lattice_theory +
, http://dbpedia.org/resource/Independent_set_%28graph_theory%29 +
, http://dbpedia.org/resource/Maximal_independent_set +
, http://dbpedia.org/resource/Electronic_Journal_of_Combinatorics +
, http://dbpedia.org/resource/Category:Families_of_sets +
, http://dbpedia.org/resource/Combinatorics +
, http://dbpedia.org/resource/European_Journal_of_Combinatorics +
, http://dbpedia.org/resource/Category:Unsolved_problems_in_mathematics +
, http://dbpedia.org/resource/Complement_set +
, http://dbpedia.org/resource/Category:Conjectures +
, http://dbpedia.org/resource/Union_%28set_theory%29 +
, http://dbpedia.org/resource/Series%E2%80%93parallel_graph +
, http://dbpedia.org/resource/Lattice_theory +
, http://dbpedia.org/resource/Timothy_Gowers +
, http://dbpedia.org/resource/Empty_set +
, http://dbpedia.org/resource/P%C3%A9ter_Frankl +
, http://dbpedia.org/resource/Journal_of_Combinatorial_Theory +
, http://dbpedia.org/resource/Undirected_graph +
, http://dbpedia.org/resource/Lattice_%28order%29 +
, http://dbpedia.org/resource/Partially_ordered_set +
, http://dbpedia.org/resource/Chordal_bipartite_graph +
, http://dbpedia.org/resource/Graph_theory +
, http://dbpedia.org/resource/Power_set +
, http://dbpedia.org/resource/Bipartite_graph +
, http://dbpedia.org/resource/Family_of_sets +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Unsolved +
, http://dbpedia.org/resource/Template:Sfnp +
, http://dbpedia.org/resource/Template:Harvtxt +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Cite_journal +
, http://dbpedia.org/resource/Template:Cite_arXiv +
, http://dbpedia.org/resource/Template:Cite_conference +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Families_of_sets +
, http://dbpedia.org/resource/Category:Conjectures +
, http://dbpedia.org/resource/Category:Lattice_theory +
, http://dbpedia.org/resource/Category:Unsolved_problems_in_mathematics +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Problem +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Union-closed_sets_conjecture?oldid=1124556017&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Union-closed_sets_conjecture +
|
| owl:sameAs |
http://yago-knowledge.org/resource/Union-closed_sets_conjecture +
, http://ru.dbpedia.org/resource/%D0%93%D0%B8%D0%BF%D0%BE%D1%82%D0%B5%D0%B7%D0%B0_%D0%A4%D1%80%D0%B0%D0%BD%D0%BA%D0%BB%D0%B0 +
, https://global.dbpedia.org/id/2mtVv +
, http://hu.dbpedia.org/resource/Frankl-sejt%C3%A9s +
, http://dbpedia.org/resource/Union-closed_sets_conjecture +
, http://www.wikidata.org/entity/Q2993338 +
, http://rdf.freebase.com/ns/m.0bwbm6 +
, http://fr.dbpedia.org/resource/Conjecture_des_familles_stables_par_unions +
|
| rdf:type |
http://dbpedia.org/class/yago/Organization108008335 +
, http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/ontology/Disease +
, http://dbpedia.org/class/yago/Unit108189659 +
, http://dbpedia.org/class/yago/SocialGroup107950920 +
, http://dbpedia.org/class/yago/WikicatSetFamilies +
, http://dbpedia.org/class/yago/Family108078020 +
, http://dbpedia.org/class/yago/YagoLegalActorGeo +
, http://dbpedia.org/class/yago/YagoLegalActor +
, http://dbpedia.org/class/yago/Group100031264 +
|
| rdfs:comment |
En mathématiques, et plus précisément en c … En mathématiques, et plus précisément en combinatoire, la conjecture des familles stables par unions est un problème d'énoncé élémentaire posé par Péter Frankl en 1979 et toujours ouvert. Une famille d'ensembles est dite stable par unions si l'union de deux ensembles quelconque de la famille est encore dans la famille. La conjecture affirme que pour toute famille finie d'ensembles finis (non vides), stable par unions, il existe un élément appartenant à au moins la moitié des ensembles de la famille.ins la moitié des ensembles de la famille.
, Гипотеза Франкла — гипотеза в комбинаторике, известная как открытая задача с элементарной формулировкой.
, In combinatorics, the union-closed sets co … In combinatorics, the union-closed sets conjecture is a problem, posed by Péter Frankl in 1979 and is still open. A family of sets is said to be union-closed if the union of any two sets from the family belongs to the family. The conjecture states: For every finite union-closed family of sets, other than the family containing only the empty set, there exists an element that belongs to at least half of the sets in the family.o at least half of the sets in the family.
|
| rdfs:label |
Conjecture des familles stables par unions
, Гипотеза Франкла
, Union-closed sets conjecture
|
