Interlacing families. I: Bipartite Ramanujan graphs of all degrees (Q2352911): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q56553645, #quickstatements; #temporary_batch_1719432696450
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095087473 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.4132 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56553645 / rank
 
Normal rank

Latest revision as of 22:15, 26 June 2024

scientific article
Language Label Description Also known as
English
Interlacing families. I: Bipartite Ramanujan graphs of all degrees
scientific article

    Statements

    Interlacing families. I: Bipartite Ramanujan graphs of all degrees (English)
    0 references
    0 references
    0 references
    0 references
    6 July 2015
    0 references
    0 references
    lifts of graphs
    0 references
    matching polynomials of graphs
    0 references
    Ramanujan graphs
    0 references
    0 references
    0 references
    0 references