Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/645413.652127guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Explicit Unique-Neighbor Expanders

Published: 16 November 2002 Publication History

Abstract

We present a simple, explicit construction of an infinite family F of bounded-degree 'unique-neighbor' expanders \Gamma; i.e., there are strictly positive constants \alpha and, such that all \Gamma = (X,E(\Gamma)) \varepsilon F satisfy the following property. For each subset S of X with no more than \alpha|X| vertices, there are at least \varepsilon|S| vertices in X \S that are adjacent in \Gamma to exactly one verte in S. The construction of F is simple to specify, and each \Gamma \varepsilon F is 6-regular. We then extend the technique and present easy to describe explicit infinite families of 4-regular and 3-regular unique-neighbor expanders, as well as explicit families of bipartite graphs with non equal color classes and similar properties.This has several applications and settles an open problem considered by various researchers.

Cited By

View all
  1. Explicit Unique-Neighbor Expanders

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Guide Proceedings
    FOCS '02: Proceedings of the 43rd Symposium on Foundations of Computer Science
    November 2002
    569 pages
    ISBN:0769518222

    Publisher

    IEEE Computer Society

    United States

    Publication History

    Published: 16 November 2002

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 16 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2018)Proof Complexity Meets AlgebraACM Transactions on Computational Logic10.1145/326598520:1(1-46)Online publication date: 20-Dec-2018
    • (2018)Wireless ExpandersProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210396(13-22)Online publication date: 11-Jul-2018
    • (2016)Symmetric unique neighbor expanders and good LDPC codesDiscrete Applied Mathematics10.1016/j.dam.2016.04.022211:C(211-216)Online publication date: 1-Oct-2016
    • (2007)Deterministic history-independent strategies for storing information on write-once memoriesProceedings of the 34th international conference on Automata, Languages and Programming10.5555/2394539.2394578(303-315)Online publication date: 9-Jul-2007

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media