Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
Fuente:
arXiv
Saved in:
| Main Author: | Chen, Yeyuan |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
by: Chen, Yeyuan
Published: (2024)
by: Chen, Yeyuan
Published: (2024)
A Simple Sub-Polynomial Degree Coboundary Expander
by: Hopkins, Max, et al.
Published: (2026)
by: Hopkins, Max, et al.
Published: (2026)
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
by: Kopparty, Swastik, et al.
Published: (2023)
by: Kopparty, Swastik, et al.
Published: (2023)
Sparser Abelian High Dimensional Expanders
by: Dikstein, Yotam, et al.
Published: (2024)
by: Dikstein, Yotam, et al.
Published: (2024)
Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025)
by: Chen, Yeyuan, et al.
Published: (2025)
Analogues of Bermond-Bollobás Conjecture for Cages Yield Expander Families
by: Eze, Leonard Chidiebere, et al.
Published: (2024)
by: Eze, Leonard Chidiebere, et al.
Published: (2024)
On locating and neighbor-locating colorings of sparse graphs
by: Chakraborty, Dipayan, et al.
Published: (2023)
by: Chakraborty, Dipayan, et al.
Published: (2023)
The $g$-good-neighbor diagnosability of product networks under the PMC model
by: Wang, Zhao, et al.
Published: (2025)
by: Wang, Zhao, et al.
Published: (2025)
Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
by: Jeronimo, Fernando Granha, et al.
Published: (2022)
by: Jeronimo, Fernando Granha, et al.
Published: (2022)
Sparse High Dimensional Expanders via Local Lifts
by: Yaacov, Inbar Ben, et al.
Published: (2024)
by: Yaacov, Inbar Ben, et al.
Published: (2024)
Pseudorandomness of Expander Walks via Fourier Analysis on Groups
by: Jeronimo, Fernando Granha, et al.
Published: (2025)
by: Jeronimo, Fernando Granha, et al.
Published: (2025)
Non-Promise Version of Unique Sink Orientations
by: Marques, Tiago Oliveira
Published: (2024)
by: Marques, Tiago Oliveira
Published: (2024)
Bears with Hats and Independence Polynomials
by: Blažej, Václav, et al.
Published: (2021)
by: Blažej, Václav, et al.
Published: (2021)
Expansion of gap-planar graphs
by: Wood, David R.
Published: (2025)
by: Wood, David R.
Published: (2025)
Polynomial Bounds in the Apex Minor Theorem
by: Hendrey, Kevin, et al.
Published: (2025)
by: Hendrey, Kevin, et al.
Published: (2025)
New Explicit Constant-Degree Lossless Expanders
by: Golowich, Louis
Published: (2023)
by: Golowich, Louis
Published: (2023)
Hypergraphs with Polynomial Representation: Introducing $r$-splits
by: Pitois, François, et al.
Published: (2022)
by: Pitois, François, et al.
Published: (2022)
On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
by: Weiß, Meike, et al.
Published: (2026)
by: Weiß, Meike, et al.
Published: (2026)
On Sets of Monochromatic Objects in Bicolored Point Sets
by: Bhore, Sujoy, et al.
Published: (2026)
by: Bhore, Sujoy, et al.
Published: (2026)
Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
by: Ai, Jiangdong, et al.
Published: (2024)
by: Ai, Jiangdong, et al.
Published: (2024)
Polynomial-time recognition and maximum independent set in Burling graphs
by: Rzążewski, Paweł, et al.
Published: (2024)
by: Rzążewski, Paweł, et al.
Published: (2024)
A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion
by: Agrawal, Akanksha, et al.
Published: (2024)
by: Agrawal, Akanksha, et al.
Published: (2024)
Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
by: Bafna, Mehul, et al.
Published: (2025)
by: Bafna, Mehul, et al.
Published: (2025)
Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
by: Gutin, Gregory, et al.
Published: (2025)
by: Gutin, Gregory, et al.
Published: (2025)
Connected Dominating Sets in Triangulations
by: Bose, Prosenjit, et al.
Published: (2023)
by: Bose, Prosenjit, et al.
Published: (2023)
Maximal Independent Sets in Planar Triangulations
by: Francis, P., et al.
Published: (2024)
by: Francis, P., et al.
Published: (2024)
Face-hitting Dominating Sets in Planar Graphs
by: Francis, P., et al.
Published: (2024)
by: Francis, P., et al.
Published: (2024)
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
by: Jäger, Gerold, et al.
Published: (2019)
by: Jäger, Gerold, et al.
Published: (2019)
Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion
by: Karol, Nikolai, et al.
Published: (2026)
by: Karol, Nikolai, et al.
Published: (2026)
Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026)
by: Spirkl, Sophie, et al.
Published: (2026)
Word-Representability of Split Graphs with Independent Set of Size 4
by: Roy, Suchanda, et al.
Published: (2025)
by: Roy, Suchanda, et al.
Published: (2025)
Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
by: Dumitrescu, Adrian, et al.
Published: (2024)
by: Dumitrescu, Adrian, et al.
Published: (2024)
Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
by: Eze, L. C., et al.
Published: (2025)
by: Eze, L. C., et al.
Published: (2025)
The average size of maximal matchings in graphs
by: Hertz, Alain, et al.
Published: (2022)
by: Hertz, Alain, et al.
Published: (2022)
Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
by: Arras, Patrick, et al.
Published: (2024)
by: Arras, Patrick, et al.
Published: (2024)
Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
by: Hatzel, Meike, et al.
Published: (2026)
by: Hatzel, Meike, et al.
Published: (2026)
Minimum Spanning Trees with Bounded Degrees of Vertices in a Specified Stable Set
by: Brause, Christoph, et al.
Published: (2022)
by: Brause, Christoph, et al.
Published: (2022)
Multigraph edge-coloring with local list sizes
by: Dhawan, Abhishek
Published: (2023)
by: Dhawan, Abhishek
Published: (2023)
A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs
by: Ihringer, Ferdinand
Published: (2024)
by: Ihringer, Ferdinand
Published: (2024)
Increasing arc-connectivity by bounded- and fixed-size inversions
by: Hörsch, Florian, et al.
Published: (2026)
by: Hörsch, Florian, et al.
Published: (2026)
Similar Items
-
The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
by: Chen, Yeyuan
Published: (2024) -
A Simple Sub-Polynomial Degree Coboundary Expander
by: Hopkins, Max, et al.
Published: (2026) -
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
by: Kopparty, Swastik, et al.
Published: (2023) -
Sparser Abelian High Dimensional Expanders
by: Dikstein, Yotam, et al.
Published: (2024) -
Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025)