Explicit construction of linear sized tolerant networks. (Reprint)
From MaRDI portal
Publication:2498004
DOI10.1016/j.disc.2006.03.025zbMath1095.68072OpenAlexW4205968440MaRDI QIDQ2498004
Publication date: 4 August 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.025
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Graph theory (05C99)
Related Items
ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES, Ordered size Ramsey number of paths, Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs.
Cites Work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Size Ramsey numbers involving stars
- Expanding graphs contain all small trees
- Ramanujan graphs
- Eigenvalues and expanders
- Hamiltonian circuits in random graphs
- On sparse graphs with dense long paths
- The size Ramsey number
- MinimumK-hamiltonian graphs
- A Graph Model for Fault-Tolerant Computing Systems
- On size Ramsey number of paths, trees, and circuits. I
- On Universal Graphs for Spanning Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item