Not all graphs are segment \(T\)-graphs (Q1813624): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The number of polytopes, configurations and real matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for families of linearly related plane convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs which contain all small graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of submatrices of a given type in a Hadamard matrix and related results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric permutations for convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal <i>n</i>-universal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey property for graphs with forbidden complete subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Approximation by Nonlinear Manifolds / rank
 
Normal rank

Latest revision as of 16:05, 14 May 2024

scientific article
Language Label Description Also known as
English
Not all graphs are segment \(T\)-graphs
scientific article

    Statements

    Identifiers