scientific article; zbMATH DE number 3349875

From MaRDI portal
Revision as of 04:06, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5625207

zbMath0221.05061MaRDI QIDQ5625207

Alan J. Hoffman

Publication date: 1970


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Complementary eigenvalues of graphsMerging the A-and Q-spectral theoriesTwo extremal problems on intersecting familiesA note on adjacency preservers on Hermitian matrices over finite fieldsMinimum supports of eigenfunctions in bilinear forms graphsArithmetic progressions with a pseudorandom stepInterlacing eigenvalues and graphsSpectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs5-chromatic strongly regular graphsSpectral Inequalities on Independence Number, Chromatic Number, and Total Chromatic Number of a GraphDegree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjectureThree conjectures in extremal spectral graph theoryHoffman's ratio boundOn the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric GraphsInequalities for the number of walks in graphsGraph Coloring Using Eigenvalue DecompositionNew spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrixUnified spectral bounds on the chromatic numberA characterization and an application of weight-regular partitions of graphsMatrix power inequalities and the number of walks in graphsNew directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023Girth, valency, and excessNew bounds for the \(\max\)-\(k\)-cut and chromatic number of a graphTo the theory of \(q\)-ary Steiner and other-type tradesA new construction of strongly regular graphs with parameters of the complement symplectic graphOrthogonal graphs of odd characteristic and their automorphismsOn the flip graphs on perfect matchings of complete graphs and signed reversal graphsGraphical designs and gale dualityGraphical designs and extremal combinatoricsSpectral bounds for the quantum chromatic number of quantum graphsMeasurable chromatic and independence numbers for ergodic graphs and group actionsTriangle-intersecting families of graphsChromatic numbers of Cayley graphs of abelian groups: a matrix methodThe spectrum of eigenvalues for certain subgraphs of the \(k\)-point fixing graphThe smallest eigenvalues of the 1-point fixing graphErdős–Ko–Rado for Random Hypergraphs: Asymptotics and StabilityMixing in High-Dimensional ExpandersTheorems of Erdős-Ko-Rado type in geometrical settingsA comparative study of two fast phase unwrapping algorithms.Spectral lower bounds for the quantum chromatic number of a graph. IISpectral bounds for the independence ratio and the chromatic number of an operatorGraphs for which the least eigenvalue is minimal. IInequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theoryForbidding just one intersection, for permutationsAn Erdős-Ko-Rado theorem for the group \(\mathrm{PSU}(3, q)\)Two remarks on Huang's characterization of the bilinear forms graphsCodes, cubes, and graphical designsA characterization of Johnson and Hamming graphs and proof of Babai's conjectureOn Laplacian spectra of parametric families of closely connected networks with application to cooperative controlEigenvalues of subgraphs of the cubeDistance Laplacian eigenvalues and chromatic number in graphsAn axiomatic duality framework for the theta body and related convex cornersSpectra, Euclidean representations and clusterings of hypergraphsSome eigenvalue properties in graphs (conjectures of Graffiti -- II)An inertial lower bound for the chromatic number of a graphOn quasi-symmetric designsBall packings with high chromatic numbers from strongly regular graphsEigenvalues and colorings of digraphsThe Colin de Verdière parameter, excluded minors, and the spectral radiusThe least eigenvalue of a graph with a given domination numberEigenvalues of the derangement graphGraphs and Hermitian matrices: eigenvalue interlacingSpectral conditions for the existence of specified paths and cycles in graphsThe smallest eigenvalue of \(K_{r}\)-free graphsOn the sum of \(k\) largest singular values of graphs and matricesTales of Hoffman: three extensions of Hoffman's bound on the graph chromatic numberEigenvalues and chromatic number of a signed graphSpectral theory of Laplace operators on oriented hypergraphsFractional decompositions and the smallest-eigenvalue separationLarge sets in finite fields are sumsetsThe toughness of Kneser graphsNormalized Laplacian eigenvalues with chromatic number and independence number of graphsMatchings in regular graphs from eigenvaluesLargest independent sets of certain regular subgraphs of the derangement graphThe spectra of multiplicative attribute graphsColoring the Voronoi tessellation of latticesIndependent Sets in Polarity GraphsLower bounds for the measurable chromatic number of the hyperbolic planeSetwise intersecting families of permutationsEigenvalues and partitionings of the edges of a graphSpectral lower bounds for the orthogonal and projective ranks of a graphOrthogonal representations over finite fields and the chromatic number of graphsOrthogonal graphs of characteristic 2 and their automorphismsOn the Laplacian spectrum of \(k\)-uniform hypergraphsLower bounds for the clique and the chromatic numbers of a graphEigenvalue interlacing and weight parameters of graphsWeighted graphs: Eigenvalues and chromatic numberBounds on graph spectraMonotone maps, sphericity and bounded second eigenvalueNEW UPPER BOUND ON THE LARGEST LAPLACIAN EIGENVALUE OF GRAPHSInequalities involving the irredundance number of a graphDual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite ProgrammingCounting independent sets in graphsGridline graphs: A review in two dimensions and an extension to higher dimensionsMore tales of Hoffman: bounds for the vector chromatic number of a graphThe product of two high-frequency graph Laplacian eigenfunctions is smoothOn partial geometries arising from maximal arcsSpectra and optimal partitions of weighted graphsOn the maximum number of non-attacking rooks on a high-dimensional simplicial chessboardNew eigenvalue bound for the fractional chromatic number






This page was built for publication: