scientific article; zbMATH DE number 3349875
From MaRDI portal
Publication:5625207
zbMath0221.05061MaRDI QIDQ5625207
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
New eigenvalue bound for the fractional chromatic number, Complementary eigenvalues of graphs, Merging the A-and Q-spectral theories, Two extremal problems on intersecting families, A note on adjacency preservers on Hermitian matrices over finite fields, Minimum supports of eigenfunctions in bilinear forms graphs, Arithmetic progressions with a pseudorandom step, Interlacing eigenvalues and graphs, Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs, 5-chromatic strongly regular graphs, Spectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a Graph, Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture, Three conjectures in extremal spectral graph theory, Hoffman's ratio bound, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, Inequalities for the number of walks in graphs, Graph Coloring Using Eigenvalue Decomposition, New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix, Unified spectral bounds on the chromatic number, A characterization and an application of weight-regular partitions of graphs, Matrix power inequalities and the number of walks in graphs, New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023, Girth, valency, and excess, New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph, To the theory of \(q\)-ary Steiner and other-type trades, A new construction of strongly regular graphs with parameters of the complement symplectic graph, Orthogonal graphs of odd characteristic and their automorphisms, On the flip graphs on perfect matchings of complete graphs and signed reversal graphs, Graphical designs and gale duality, Graphical designs and extremal combinatorics, Spectral bounds for the quantum chromatic number of quantum graphs, Measurable chromatic and independence numbers for ergodic graphs and group actions, Triangle-intersecting families of graphs, Chromatic numbers of Cayley graphs of abelian groups: a matrix method, The spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graph, The smallest eigenvalues of the 1-point fixing graph, Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability, Mixing in High-Dimensional Expanders, Theorems of Erdős-Ko-Rado type in geometrical settings, A comparative study of two fast phase unwrapping algorithms., Spectral lower bounds for the quantum chromatic number of a graph. II, Spectral bounds for the independence ratio and the chromatic number of an operator, Graphs for which the least eigenvalue is minimal. I, Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theory, Forbidding just one intersection, for permutations, An Erdős-Ko-Rado theorem for the group \(\mathrm{PSU}(3, q)\), Two remarks on Huang's characterization of the bilinear forms graphs, Codes, cubes, and graphical designs, A characterization of Johnson and Hamming graphs and proof of Babai's conjecture, On Laplacian spectra of parametric families of closely connected networks with application to cooperative control, Eigenvalues of subgraphs of the cube, Distance Laplacian eigenvalues and chromatic number in graphs, An axiomatic duality framework for the theta body and related convex corners, Spectra, Euclidean representations and clusterings of hypergraphs, Some eigenvalue properties in graphs (conjectures of Graffiti -- II), An inertial lower bound for the chromatic number of a graph, On quasi-symmetric designs, Ball packings with high chromatic numbers from strongly regular graphs, Eigenvalues and colorings of digraphs, The Colin de Verdière parameter, excluded minors, and the spectral radius, The least eigenvalue of a graph with a given domination number, Eigenvalues of the derangement graph, Graphs and Hermitian matrices: eigenvalue interlacing, Spectral conditions for the existence of specified paths and cycles in graphs, The smallest eigenvalue of \(K_{r}\)-free graphs, On the sum of \(k\) largest singular values of graphs and matrices, Tales of Hoffman: three extensions of Hoffman's bound on the graph chromatic number, Eigenvalues and chromatic number of a signed graph, Spectral theory of Laplace operators on oriented hypergraphs, Fractional decompositions and the smallest-eigenvalue separation, Large sets in finite fields are sumsets, The toughness of Kneser graphs, Normalized Laplacian eigenvalues with chromatic number and independence number of graphs, Matchings in regular graphs from eigenvalues, Largest independent sets of certain regular subgraphs of the derangement graph, The spectra of multiplicative attribute graphs, Coloring the Voronoi tessellation of lattices, Independent Sets in Polarity Graphs, Lower bounds for the measurable chromatic number of the hyperbolic plane, Setwise intersecting families of permutations, Eigenvalues and partitionings of the edges of a graph, Spectral lower bounds for the orthogonal and projective ranks of a graph, Orthogonal representations over finite fields and the chromatic number of graphs, Orthogonal graphs of characteristic 2 and their automorphisms, On the Laplacian spectrum of \(k\)-uniform hypergraphs, Lower bounds for the clique and the chromatic numbers of a graph, Eigenvalue interlacing and weight parameters of graphs, Weighted graphs: Eigenvalues and chromatic number, Bounds on graph spectra, Monotone maps, sphericity and bounded second eigenvalue, NEW UPPER BOUND ON THE LARGEST LAPLACIAN EIGENVALUE OF GRAPHS, Inequalities involving the irredundance number of a graph, Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming, Counting independent sets in graphs, Gridline graphs: A review in two dimensions and an extension to higher dimensions, More tales of Hoffman: bounds for the vector chromatic number of a graph, The product of two high-frequency graph Laplacian eigenfunctions is smooth, On partial geometries arising from maximal arcs, Spectra and optimal partitions of weighted graphs, On the maximum number of non-attacking rooks on a high-dimensional simplicial chessboard
