Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Expander_mixing_lemma> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- Expander_mixing_lemma abstract "The expander mixing lemma states that, for any two subsets of a d-regular expander graph , the number of edges between and is approximately what you would expect in a random d-regular graph, i.e. .".
- Expander_mixing_lemma wikiPageExternalLink raman_lift.pdf.
- Expander_mixing_lemma wikiPageExternalLink lec2.pdf.
- Expander_mixing_lemma wikiPageID "6230931".
- Expander_mixing_lemma wikiPageRevisionID "537579429".
- Expander_mixing_lemma hasPhotoCollection Expander_mixing_lemma.
- Expander_mixing_lemma subject Category:Graph_theory.
- Expander_mixing_lemma subject Category:Lemmas.
- Expander_mixing_lemma subject Category:Theoretical_computer_science.
- Expander_mixing_lemma type Abstraction100002137.
- Expander_mixing_lemma type Communication100033020.
- Expander_mixing_lemma type Lemma106751833.
- Expander_mixing_lemma type Lemmas.
- Expander_mixing_lemma type Message106598915.
- Expander_mixing_lemma type Proposition106750804.
- Expander_mixing_lemma type Statement106722453.
- Expander_mixing_lemma comment "The expander mixing lemma states that, for any two subsets of a d-regular expander graph , the number of edges between and is approximately what you would expect in a random d-regular graph, i.e. .".
- Expander_mixing_lemma label "Expander mixing lemma".
- Expander_mixing_lemma sameAs m.0fxzwq.
- Expander_mixing_lemma sameAs Q5420759.
- Expander_mixing_lemma sameAs Q5420759.
- Expander_mixing_lemma sameAs Expander_mixing_lemma.
- Expander_mixing_lemma wasDerivedFrom Expander_mixing_lemma?oldid=537579429.
- Expander_mixing_lemma isPrimaryTopicOf Expander_mixing_lemma.