| http://dbpedia.org/ontology/abstract
|
In mathematics, dependent random choice is … In mathematics, dependent random choice is a probabilistic technique that shows how to find a large set of vertices in a dense graph such that every small subset of vertices has many common neighbors. It is a useful tool to embed a graph into another graph with many edges. Thus it has its application in extremal graph theory, additive combinatorics and Ramsey theory. additive combinatorics and Ramsey theory.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://math.mit.edu/~fox/paper-dependent-random-choice.pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
62112877
|
| http://dbpedia.org/ontology/wikiPageLength
|
9780
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1117783309
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Ramsey%27s_theorem +
, http://dbpedia.org/resource/Additive_combinatorics +
, http://dbpedia.org/resource/Probabilistic +
, http://dbpedia.org/resource/Vertex_%28geometry%29 +
, http://dbpedia.org/resource/Degeneracy_%28graph_theory%29 +
, http://dbpedia.org/resource/Category:Extremal_graph_theory +
, http://dbpedia.org/resource/Homeomorphism_%28graph_theory%29 +
, http://dbpedia.org/resource/Tur%C3%A1n_number +
, http://dbpedia.org/resource/Graph_theory +
, http://dbpedia.org/resource/Ramsey_theory +
, http://dbpedia.org/resource/Extremal_graph_theory +
, http://dbpedia.org/resource/Bipartite_graph +
, http://dbpedia.org/resource/Category:Probabilistic_arguments +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Probabilistic_arguments +
, http://dbpedia.org/resource/Category:Extremal_graph_theory +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Dependent_random_choice?oldid=1117783309&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Dependent_random_choice +
|
| owl:sameAs |
http://dbpedia.org/resource/Dependent_random_choice +
, https://global.dbpedia.org/id/BvdGt +
, http://www.wikidata.org/entity/Q96376236 +
|
| rdfs:comment |
In mathematics, dependent random choice is … In mathematics, dependent random choice is a probabilistic technique that shows how to find a large set of vertices in a dense graph such that every small subset of vertices has many common neighbors. It is a useful tool to embed a graph into another graph with many edges. Thus it has its application in extremal graph theory, additive combinatorics and Ramsey theory. additive combinatorics and Ramsey theory.
|
| rdfs:label |
Dependent random choice
|
