Graphs with few paths of prescribed length between any two vertices (Q5110588): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q126994613, #quickstatements; #temporary_batch_1722364966119
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1411.0856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm-graphs: Variations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Regular Graphs of Girths Eight and Twelve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random algebraic construction of extremal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4950147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of degenerate extremal graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm-graphs and bipartite Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of Points of Varieties in Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit construction of graphs with an arbitrary large girth and of large size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new series of dense graphs of high girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of bipartite graphs from finite geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimal graphs of maximum even girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without theta subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126994613 / rank
 
Normal rank

Latest revision as of 19:59, 30 July 2024

scientific article; zbMATH DE number 7202635
Language Label Description Also known as
English
Graphs with few paths of prescribed length between any two vertices
scientific article; zbMATH DE number 7202635

    Statements

    Graphs with few paths of prescribed length between any two vertices (English)
    0 references
    0 references
    21 May 2020
    0 references
    Bukh's random algebraic method
    0 references

    Identifiers

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