Ramanujan graphs

From MaRDI portal

Publication:1112836

Jump to:navigation, search

DOI10.1007/BF02126799zbMath0661.05035OpenAlexW4235946010WikidataQ56442222 ScholiaQ56442222MaRDI QIDQ1112836

Alexander Lubotzky, Ralph S. Phillips, Peter C. Sarnak

Publication date: 1988

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02126799

zbMATH Keywords

expanders Ramanujan graph combinatorial properties

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

A construction of combinatorial NLTS, On the Origins, Nature, and Impact of Bourgain’s Discretized Sum-Product Theorem, On the diameter and bisector size of Cayley graphs, Recent Developments in Low-Density Parity-Check Codes, Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap, Graphs with high second eigenvalue multiplicity, Finding any given 2‐factor in sparse pseudorandom graphs efficiently, Assouad-Nagata dimension and gap for ordered metric spaces, A randomized construction of high girth regular graphs, Gap sets for the spectra of cubic graphs, Spectra of infinite graphs via freeness with amalgamation, A simple proof for the lower bound of the girth of graphs \(D(n,q)\), Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings, On the cop number of graphs of high girth, A spectral bound for vertex-transitive graphs and their spanning subgraphs, One-matching bi-Cayley graphs and homogeneous bi-Cayley graphs over finite cyclic groups, Adventures in Supersingularland, Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\), The limit theorem with respect to the matrices on non-backtracking paths of a graph, Universal Features for High-Dimensional Learning and Inference, Graph rigidity properties of Ramanujan graphs, Kneser's method of neighbors, Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions, Spectrum of random d‐regular graphs up to the edge, On sparse parity check matrices (extended abstract), On the eigenvalues of the graphs \(D(5,q)\), Paradigms for Unconditional Pseudorandom Generators, Parameterized Counting and Cayley Graph Expanders, Explicit non-malleable codes from bipartite graphs, Almost quasi-isometries and more non-C*-exact groups, The Ramsey number of a long even cycle versus a star, Equitable partition for some Ramanujan graphs, Asymptotic Absence of Poles of Ihara Zeta Function of Large Erdős–Rényi Random Graphs, Improved non-approximability results for vertex cover with density constraints, Small diameters and generators for arithmetic lattices in \(\mathrm{SL}_2 (\mathbb{R})\) and certain Ramanujan graphs, On inverted Kloosterman sums over finite fields, The asymptotics of \(r(4,t)\), Graphs of large chromatic number, Interactions of computational complexity theory and mathematics, Constructions of strongly regular Cayley graphs derived from weakly regular bent functions, Mixing in High-Dimensional Expanders, Simply transitive quaternionic lattices of rank 2 over_q(t) and a non-classical fake quadric, Unnamed Item, Répartition asymptotique des valeurs propres de l’opérateur de Hecke 𝑇_𝑝, Metric number theory of Fourier coefficients of modular forms, Excluded Forest Minors and the Erdős–Pósa Property, Comparison of Metric Spectral Gaps, Component Games on Regular Graphs, Regular maps on surfaces with large planar width, Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity, Selberg zeta functions over function fields, The size-Ramsey number of trees, Sparse and limited wavelength conversion in all-optical tree networks, The cut metric, random graphs, and branching processes, Cycle density in infinite Ramanujan graphs, A Bipartite Strengthening of the Crossing Lemma, Collisions for the LPS Expander Graph Hash Function, Expanders with respect to Hadamard spaces and random graphs, Explicit Near-Ramanujan Graphs of Every Degree, Experiments with the Markoff Surface, What Do Networks and Elliptic Curves Have in Common?, On the relationship between the diameter and the size of a boundary of a directed graph, Subconstituents of unitary Cayley graph of matrix algebras, Methods for message routing in parallel machines, Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling, Ramanujan complexes and golden gates in \(PU(3)\), Hash functions and Cayley graphs, High-girth near-Ramanujan graphs with localized eigenvectors, Multi-processor scheduling and expanders, Recursive construction for 3-regular expanders, Eigenvalues of Cayley graphs, Tough Ramsey graphs without short cycles, Cutoff on graphs and the Sarnak-Xue density of eigenvalues, Explicit construction of graphs with an arbitrary large girth and of large size, Packing directed circuits fractionally, Linear-time list recovery of high-rate expander codes, Graph spectra for finite upper half planes over rings, Eigenvalues, eigenspaces and distances to subsets, Parameterized complexity classes defined by threshold circuits: using sorting networks to show collapses with W-hierarchy classes, Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults, Fast perfect-information leader-election protocols with linear immunity, Finite fields and Ramanujan graphs, Local expanders, The complexity of cover graph recognition for some varieties of finite lattices, The complexity and approximability of finding maximum feasible subsystems of linear relations, On the distortion required for embedding finite metric spaces into normed spaces, Walks on generating sets of Abelian groups, High girth and extendability, Finite analogues of Euclidean space, On the chromatic number of structured Cayley graphs, A characterization of the components of the graphs \(D(k,q)\), The geometry of spontaneous spiking in neuronal networks, Ramanujan coverings of graphs, \(N\)-step energy of maps and the fixed-point property of random groups., Fractional and circular separation dimension of graphs, On the approximability of the Steiner tree problem., Constant time parallel sorting: An empirical view., Measurable chromatic and independence numbers for ergodic graphs and group actions, Giant vacant component left by a random walk in a random \(d\)-regular graph, Super-Golden-Gates for \(PU(2)\), Relative expanders or weakly relatively Ramanujan graphs., Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs, Improved non-approximability results for minimum vertex cover with density constraints, On the connectivity of certain graphs of high girth., On codes from hypergraphs., Cayley graphs and complexity geometry, Nonbacktracking spectrum of random graphs: community detection and nonregular Ramanujan graphs, On sensitivity of mixing times and cutoff, On sparse spanners of weighted graphs, Cubic Ramanujan graphs, Microlocal lifts and quantum unique ergodicity on \(\mathrm{GL}_2(\mathbb Q_p)\), Better path-finding algorithms in LPS Ramanujan graphs, On the essential spectrum of Schrödinger operators on trees, Clumsy packings of graphs, The girth alternative for mapping class groups., Super-expanders and warped cones, Resolution with counting: dag-like lower bounds and different moduli, Box spaces of the free group that neither contain expanders nor embed into a Hilbert space, The minimal length product over homology bases of manifolds, Cycle lengths in expanding graphs, Quantum ergodicity for expanding quantum graphs in the regime of spectral delocalization, Recent progress in combinatorial random matrix theory, Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey, A priori TSP in the scenario model, An explicit infinite family of \(\mathbb{M}\)-vertex graphs with maximum degree \(K\) and diameter \([1+o(1)\log_{K-1}\mathbb{M}\) for each \(K-1\) a prime power], The spectral geometry of \(k\)-regular groups, Spectra of random regular hypergraphs, Some geometric aspects of graphs and their eigenfunctions, On eigenvalues related to finite Poincaré planes, Some Cayley graphs for simple groups, The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs, Covering odd cycles, On the spectra of certain graphs arising from finite fields, The Littlewood-Offord problem for Markov chains, Expanding graphs and invariant means, Approximating hyper-rectangles: Learning and pseudorandom sets, Not every uniform tree covers Ramanujan graphs, On arithmetic infinite graphs, Weighted expanders and the anisotropic Alon-Boppana theorem, The integrity of a cubic graph, The exact convergence rate in the ergodic theorem of Lubotzky-Phillips-Sarnak and a universal lower bound on discrepancies, Logarithmic girth expander graphs of \(SL_n({\mathbb{F}}_p)\), Comparing eigenvalue bounds for Markov chains: When does Poincaré beat Cheeger?, On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\), Natural bounded concentrators, Derandomized graph products, Zeta functions of finite graphs and coverings. II, The Ramanujan property for regular cubical complexes, Kissing numbers of regular graphs, The finite upper half space and related hypergraphs, Ramanujan edge-indexed graphs, A continuous analogue of the girth problem, On the spectrum, the growth, and the diameter of a graph, Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs, On weighted vs unweighted versions of combinatorial optimization problems, Homological filling functions with coefficients, Around quasidiagonal operators, On monoid graphs, New and explicit constructions of unbalanced Ramanujan bipartite graphs, On the spectral gap for infinite index ``congruence subgroups of SL\(_2(\mathbb{Z})\), Wavelength routing in optical networks of diameter two, Expanders and box spaces, Quantum ergodicity on regular graphs, Approximate groups and doubling metrics, Shift lifts preserving Ramanujan property, Tight products and graph expansion, Jacobi's four and eight squares theorems and partitions into distinct parts, Expanders and time-restricted branching programs, On the Ihara zeta function of cones over regular graphs, Isoperimetric numbers of graphs, Explicit construction of a Ramanujan \((n_1,n_2,\dots,n_{d-1})\)-regular hypergraph, Deterministic algorithms for matrix completion, The eigenvalues of the graphs \(D(4,q)\), A tight Erdős-Pósa function for long cycles, Spectral bounds of directed Cayley graphs of finite groups, Cutoff on Ramanujan complexes and classical groups, Mean-field conditions for percolation on finite graphs, Three conjectures in extremal spectral graph theory, Isoperimetric inequalities in simplicial complexes, On the spectral distribution of large weighted random regular graphs, On the connectivity and independence number of power graphs of groups, Explicit expanding expanders, Generating sets for the multiplicative groups of algebras over finite fields and expander graphs, On sensitivity in bipartite Cayley graphs, Large cuts with local algorithms on triangle-free graphs, Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines, A random cover of a compact hyperbolic surface has relative spectral gap \(\frac{3}{16}-\varepsilon\), Spectrum and combinatorics of two-dimensional Ramanujan complexes, Expander construction in \(\mathrm{VNC}^1\), Line-graph lattices: Euclidean and non-Euclidean flat bands, and implementations in circuit quantum electrodynamics, Optimal strong approximation for quadrics over \(\mathbb{F}_q [t\)], On the almost eigenvectors of random regular graphs, Local Kesten-McKay law for random regular graphs, Unitary Cayley graphs of matrix rings over finite commutative rings, Ramanujan graphs and exponential sums over function fields, Edge rigidity and universality of random regular graphs of intermediate degree, On the structure of random graphs with constant \(r\)-balls, Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time, ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE, Constraints, MMSNP and expander relational structures, On a conjecture of Erdős and Simonovits: even cycles, Some Ramanujan hypergraphs associated to $GL(n,\mathbb {F}_q)$, Kesten's theorem for invariant random subgroups., Random walks on Ramanujan complexes and digraphs, Zeta functions of complexes arising from \(\mathrm{PGL}(3)\), Regular partitions of gentle graphs, New bounds on even cycle creating Hamiltonian paths using expander graphs, A connection between a question of Bermond and Bollobás and Ramanujan graphs, Computation of best possible low degree expanders, Ramanujan bigraphs associated with $SU(3)$ over a $p$-adic field, Explicit expanders of every degree and size, Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas, Nonlinear spectral calculus and super-expanders, Graphs (networks) with golden spectral ratio, Combinatorial algorithms for distributed graph coloring, General properties of some families of graphs defined by systems of equations, Paley type sets from cyclotomic classes and Aarasu-Dillon-Player difference sets, The reversal ratio of a poset., On the extreme eigenvalues of regular graphs., Logarithmic reduction of the level of randomness in some probabilistic geometric constructions, Toughness in graphs -- a survey, Graph-based convolutional and block LDPC codes, Eigenvalues of graphs and a simple proof of a theorem of Greenberg, Optimal strong approximation for quadratic forms, Explicit construction of linear sized tolerant networks. (Reprint), Closed walks and eigenvalues of abelian Cayley graphs, A strengthening and a multipartite generalization of the Alon-Boppana-Serre theorem, \(L^p\)-expander graphs, Sums of seven octahedral numbers, Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders, The chromatic number of random Cayley graphs, Statistical properties of zeta functions' zeros, Explicit Construction of Ramanujan Bigraphs, On the relation of separability, bandwidth and embedding, Cryptographic Hash Functions and Expander Graphs: The End of the Story?, Ramanujan graphs and expander families constructed from \(p\)-ary bent functions, Recent results of quantum ergodicity on graphs and further investigation, Bartholdi zeta functions of periodic graphs, SELECTED TOPICS IN SPECTRAL GRAPH THEORY, Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue, Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs, Candidate One-Way Functions Based on Expander Graphs, Opinion forming in Erdős-Rényi random graph and expanders, On the local geometry of graphs in terms of their spectra, Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph, On random random walks, Hypergraph expanders from Cayley graphs, Ramanujan graphs on cosets of \(\operatorname{PGL}_2(\mathbb F_q)\), Cutoff on hyperbolic surfaces, Some elementary Ramanujan graphs, Navigating in the Cayley graphs of \(\text{SL}_N(\mathbb{Z})\) and \(\text{SL}_N(\mathbb{F}_p)\)., A new proof of Bartholdi's theorem, A hierarchy of randomness for graphs, Efficient gossip and robust distributed computation, Integral circulant Ramanujan graphs via multiplicativity and ultrafriable integers, Quantum ergodicity on large regular graphs, Median eigenvalues and the HOMO-LUMO index of graphs, Local correctability of expander codes, Quadratic unitary Cayley graphs of finite commutative rings, Interlacing families. I: Bipartite Ramanujan graphs of all degrees, Synchronization of coupled chaotic maps, Spectral analysis of the affine graph over the finite ring, On encoding symbol degrees of array BP-XOR codes, Explicit spectral gaps for random covers of Riemann surfaces, Simple and optimal randomized fault-tolerant rumor spreading, Quantum ergodicity for quantum graphs without back-scattering, Hard constraint satisfaction problems have hard gaps at location 1, Small complete minors above the extremal edge density, Affine linear sieve, expanders, and sum-product, Upper bounds on the bisection width of 3- and 4-regular graphs, Zeta functions of finite graphs and coverings. III, Robust gossiping with an application to consensus, Symmetric unique neighbor expanders and good LDPC codes, Poisson-Dirichlet distribution for random Belyi surfaces, Cutoff on all Ramanujan graphs, Explicit construction of linear sized tolerant networks, Affine extractors over large fields with exponential error, A bipartite analogue of Dilworth's theorem, Expansion in SL\(_2(\mathbb R)\) and monotone expanders, Tactical configurations and their generic ring, Sorting in rounds, New spectral lower bounds on the bisection width of graphs, Functional limit theorems for random regular graphs, Colorings of the \(d\)-regular infinite tree, Bounds on the minimum code distance for nonbinary codes based on bipartite graphs, Strong uniform expansion in \(\text{SL}(2,p)\)., Constructing uniquely realizable graphs, Pseudorandom generators for combinatorial checkerboards, Integral circulant Ramanujan graphs of prime power order, On the spectrum of Wenger graphs, Design of highly synchronizable and robust networks, On regular hypergraphs of high girth, Extremal edge polytopes, Cayley-type graphs for group-subgroup pairs, Low-distortion embeddings of graphs with large girth, Path Laplacian matrices: introduction and application to the analysis of consensus in networks, On dissemination thresholds in regular and irregular graph classes, Classical Kloosterman sums: representation theory, magic squares, and Ramanujan multigraphs, Graph spectra in computer science, Shaping bursting by electrical coupling and noise, A quantitative version of the non-Abelian idempotent theorem, CAT(0) spaces and expanders., A concentration theorem of expanders on Hadamard manifolds, Some topics in the dynamics of group actions on rooted trees., Small-diameter Cayley graphs for finite simple groups, Derandomized parallel repetition via structured PCPs, The extremal symmetry of arithmetic simplicial complexes, Note on the girth of Ramanujan graphs, Cycle bases in graphs characterization, algorithms, complexity, and applications, Almost-Ramanujan graphs and prime gaps, A lower bound on the area of permutation layouts, Ramanujan complexes and high dimensional expanders, Higher dimensional Moore bounds, A note on the token distribution problem, Regular graphs of large girth and arbitrary degree, Higher index theory for certain expanders and Gromov monster groups. I, On the second eigenvalue of a graph, The symbiotic relationship of combinatorics and matrix theory, Lower bounds for tropical circuits and dynamic programs, Expansion of random graphs: new proofs, new results, Matching nuts and bolts faster, Optimal topological design for distributed estimation over sensor networks, Corrigendum to: ``Almost-Ramanujan graphs and prime gaps, On eigenvalues of random complexes, On 3rd and 4th moments of finite upper half plane graphs, Complexity measures of sign matrices, A separation theorem in property testing, Cycle lengths in sparse graphs, A domain monotonicity theorem for graphs and Hamiltonicity, The Steiner tree problem on graphs: inapproximability results, On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\), On the girth of infinite graphs, Laplace eigenvalues of graphs---a survey, Optimal slope selection via expanders, Box representations of embedded graphs, Sparse regular random graphs: spectral density and eigenvectors, Doing-it-all with bounded work and communication, A bipartite strengthening of the crossing Lemma, Highly symmetric expanders, Probability of graphs with large spectral gap by multicanonical Monte Carlo, Gossiping by processors prone to omission failures, A lower bound on the spectral radius of the universal cover of a graph, Spectra of lifted Ramanujan graphs, Explicit constructions of Ramanujan complexes of type \(\widetilde A_d\)., On the limitations of the use of solvable groups in Cayley graph cage constructions, Optimal configurations for peer-to-peer user-private information retrieval, Geodesics with one self-intersection, and other stories, On the chromatic number of a simplicial complex, The measurable Kesten theorem, On universal hypergraphs, A robust randomized algorithm to perform independent tasks, Hecke graphs, Ramanujan graphs and generalized duality transformations for lattice spin systems, Expander graphs based on GRH with an application to elliptic curve cryptography, The second eigenvalue of regular graphs of given girth, Cryptographic hash functions from expander graphs, Minimum cuts, girth and a spectral threshold, Hamiltonian paths in Cayley graphs, On \(k\)-chromatically connected graphs, Parallel sorting on Cayley graphs, On the spectral gap for infinite index ``congruence subgroups of \(SL_2(\mathbb{Z})\), Ramanujan complexes of type \(\widetilde A_d\), CONVOLUTIONS OF RAMANUJAN SUMS AND INTEGRAL CIRCULANT GRAPHS, MODp-tests, almost independence and small probability spaces, Overlap properties of geometric expanders, Unnamed Item, Ramanujan graphings and correlation decay in local algorithms, Expander Construction in VNC1, Expanding Generating Sets for Solvable Permutation Groups, Geometry and Combinatorics via Right-Angled Artin Groups, The complexity of error-correcting codes, Efficient parallel computing with memory faults, Graphs, Vectors, and Matrices, Communication Lower Bounds via Critical Block Sensitivity, Random Cayley graphs and expanders, Local-Global Phenomena in Graphs, Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes, Local Expansion of Symmetrical Graphs, Rolling backwards can move you forward: On embedding problems in sparse expanders, Unnamed Item, Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs, Eigenvalues of Graphs and Sobolev Inequalities, The Graph Curvature Calculator and the Curvatures of Cubic Graphs, On an anti‐Ramsey property of Ramanujan graphs, A survey of graph laplacians, Eigenvalues and the diameter of graphs, Induced cayley graphs and d0ouble covers, A new series of dense graphs of high girth, Constructions of permutation arrays for certain scheduling cost measures, Quantum ergodicity for large equilateral quantum graphs, Expander graphs and their applications, Unnamed Item, Unnamed Item, Network-complement transitions, symmetries, and cluster synchronization, POLISH MODELS AND SOFIC ENTROPY, On high-girth expander graphs with localized eigenvectors, Optimal induced universal graphs for bounded-degree graphs, Ihara Zeta function, coefficients of Maclaurin series and Ramanujan graphs, Unitary homogeneous bi-Cayley graphs over finite commutative rings, Parallel Repetition of Two-Prover One-Round Games: An Exposition, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, An Elementary Construction of Constant-Degree Expanders, Quasirandom Groups, Formal Zeta function expansions and the frequency of Ramanujan graphs, Ramanujan Graphs in Cryptography, On the theory of interconnection networks for parallel computers, Some physical and chemical indices of clique-inserted lattices, ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES, From Expanders to Hitting Distributions and Simulation Theorems, Deterministic methods of Ramanujan graph construction for use in cryptographic algorithms based on generalized cellular automata, Quasirandom Cayley graphs, COBOUNDARY EXPANDERS, Finite Euclidean graphs over rings, Keyed hash function from large girth expander graphs, Construction of expanders and superconcentrators using Kolmogorov complexity, Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time, A note on the Size-Ramsey number of long subdivisions of graphs, Symmetric groups and expanders, Unnamed Item, A unified framework for off-line permutation routing in parallel networks, Quaternionic arithmetic lattices of rank 2 and a fake quadric in characteristic 2, Spectra of hyperbolic surfaces, Limiting eigenvalue distribution of random matrices of Ihara zeta function of long-range percolation graphs, Poisson approximation of the length spectrum of random surfaces, A combinatorial proof of Bass's determinant formula for the zeta function of regular graphs, Generalized Group–Subgroup Pair Graphs, Ramanujan Graphs for Post-Quantum Cryptography, Distributed Corruption Detection in Networks, A spectral strong approximation theorem for measure-preserving actions, Riemann’s zeta function and beyond, Ramanujan graphs and Hecke operators, Bravely, Moderately: A Common Theme in Four Recent Works, Basic Facts about Expander Graphs, A fast new algorithm for weak graph regularity, Survey of Spectra of Laplacians on Finite Symmetric Spaces, Opinion Forming in Erdös-Rényi Random Graph and Expanders, Combinatorial Algorithms for Distributed Graph Coloring, On non-uniform Ramanujan complexes, Unnamed Item, ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS, On the Expansion of Group-Based Lifts, Remarks on periodic Jacobi matrices on trees, Girth of sparse graphs, Planar graphs: Random walks and bipartiteness testing, Infinite series of quaternionic 1-vertex cube complexes, the doubling construction, and explicit cubical Ramanujan complexes, Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models, Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that, Expander graphs in pure and applied mathematics, The Ramanujan conjecture and its applications, From Ramanujan graphs to Ramanujan complexes, On Selberg’s eigenvalue conjecture for moduli spaces of abelian differentials, Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs., Certifiably Pseudorandom Financial Derivatives, The Diameters of Some Classical Groups with Respect to a Small Generating Set, The size‐Ramsey number of powers of bounded degree trees, Growth in groups: ideas and perspectives, Ramanujan graphs arising as weighted Galois covering graphs, On the Expansion of Group-Based Lifts, Graph Powering and Spectral Robustness, Turán problems for integer-weighted graphs, Diameters and Eigenvalues, Tensor quasi-random groups

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1112836&oldid=13156459"