Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture (Q867926): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2005.10.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1533248588 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q123344904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5476491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stable set problem and the lift-and-project ranks of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank

Latest revision as of 14:56, 25 June 2024

scientific article
Language Label Description Also known as
English
Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture
scientific article

    Statements

    Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture (English)
    0 references
    19 February 2007
    0 references
    0 references
    stable set
    0 references
    lift-and-project
    0 references
    graph subdivision
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references