Universal completability, least eigenvalue frameworks, and vector colorings (Q2408207): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SageMath / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962861404 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59523050 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1512.04972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Technique for Coloring Random 3-Colorable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line graphs, root systems, and elliptic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of the product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenpolytopes of Distance Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in association schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph cores via universal completability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal completability, least eigenvalue frameworks, and vector colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sabidussi versus Hedetniemi for three variations of the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transitions in semidefinite relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate graph coloring by semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite matrix completion, universal rigidity and the strong Arnold property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new graph parameter related to bounded rank positive semidefinite matrix completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the null space of a Colin de Verdière matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing uniquely realizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of the Delsarte and Lovász bounds / rank
 
Normal rank

Latest revision as of 13:15, 14 July 2024

scientific article
Language Label Description Also known as
English
Universal completability, least eigenvalue frameworks, and vector colorings
scientific article

    Statements

    Universal completability, least eigenvalue frameworks, and vector colorings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2017
    0 references
    semidefinite programming
    0 references
    least eigenvalue
    0 references
    vector colorings
    0 references
    Lovász theta number
    0 references
    universal rigidity
    0 references
    positive semidefinite matrix completion
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references