Graphical designs and extremal combinatorics

DOI10.1016/j.laa.2020.07.012zbMath1446.05018arXiv1910.05966OpenAlexW3040906459MaRDI QIDQ2197221

Konstantin Golubev

Publication date: 28 August 2020

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.05966

zbMATH Keywords

samplingdesignLaplaciangraph Laplacian

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) General topics in linear spectral theory for PDEs (35P05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Designs and configurations (05B99) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Optimal and extremal graphical designs on regular graphs associated with classical parameters ⋮ Graphical designs and gale duality ⋮ Eigenpolytope Universality and Graphical Designs ⋮ Perfect colorings of the infinite square grid: coverings and twin colors ⋮ Codes, cubes, and graphical designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal asymptotic bounds for spherical designs
• Spectral bounds for the independence ratio and the chromatic number of an operator
• Ramanujan complexes and high dimensional expanders
• Sharp \(L^1\)-Poincaré inequalities correspond to optimal hypersurface cuts
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• On the measure of intersecting families, uniqueness and stability
• A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
• On the spectrum of the derangement graph
• A survey of the theory of hypercube graphs
• Eigenvalues and expanders
• On the maximum number of permutations with given maximal or minimal distance
• Local spectral expansion approach to high dimensional expanders. I: Descent of spectral gaps
• Graph products, Fourier analysis and spectral techniques
• Lower bounds for the measurable chromatic number of the hyperbolic plane
• The density of sets avoiding distance 1 in Euclidean space
• Isoperimetric inequalities in simplicial complexes
• Higher dimensional discrete Cheeger inequalities
• Explicit Concentrators from Generalized N-Gons
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The Kronecker Product of Graphs
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• Sampling in Paley-Wiener spaces on combinatorial graphs
• A note on the isoperimetric constant
• On the Shannon capacity of a graph
• Spherical Sets Avoiding a Prescribed Set of Angles
• Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
• Generalized designs on graphs: Sampling, spectra, symmetries
• Optimal Numerical Integration on a Sphere
• Intersecting families of permutations

This page was built for publication: Graphical designs and extremal combinatorics