Tough Ramsey graphs without short cycles
From MaRDI portal
Publication:1893953
DOI10.1023/A:1022453926717zbMath0826.05039OpenAlexW1482486802MaRDI QIDQ1893953
Publication date: 16 November 1995
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022453926717
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Generalized Ramsey theory (05C55)
Related Items
Toughness and normalized Laplacian eigenvalues of graphs, Toughness and spectrum of a graph, Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph, Constructive bounds for a Ramsey-type problem, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, The spectrum and toughness of regular graphs, ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs, Spectral bounds for the vulnerability parameters of graphs, Sharp spectral bounds for the vertex-connectivity of regular graphs, Edge-disjoint spanning trees and eigenvalues of regular graphs, Binding number, \(k\)-factor and spectral radius of graphs, Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs, Graph toughness from Laplacian eigenvalues, Toughness, Hamiltonicity and spectral radius in graphs, Toughness in pseudo-random graphs, Lovász, Vectors, Graphs and Codes, Triangle-free graphs whose independence number equals the degree, Toughness in graphs -- a survey, The toughness of Kneser graphs, Expander graphs based on GRH with an application to elliptic curve cryptography, Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs, A Proof of Brouwer's Toughness Conjecture, \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- A note on the independence number of triangle-free graphs
- Explicit construction of linear sized tolerant networks
- Ramanujan graphs
- Eigenvalues and expanders
- A note on Ramsey numbers
- A note on constructive lower bounds for the Ramsey numbers \(R(3, t)\)
- Asymptotic lower bounds for Ramsey functions
- Toughness and triangle-free graphs
- Tough graphs and Hamiltonian circuits.
- Explicit Concentrators from Generalized N-Gons
- Graph Theory and Probability
- Graph Theory and Probability. II
- Random Cayley graphs and expanders
- On the construction of certain graphs
