Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Interpreting nowhere dense graph classes as a classical notion of model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing patterns of semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdös-Hajnal Conjecture-A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing first-order properties for subclasses of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood complexity and kernelization for nowhere dense classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán-type results for partial orders and intersection graphs of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Interpretations of Bounded Expansion Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4625695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First-Order Properties of Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular partitions of gentle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On low rank-width colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity lemmas for stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations and examples of graph classes with bounded expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering powers of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. II: Algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nowhere dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial bounds for centered colorings on proper minor-closed graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of types in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pure pairs. V: Excluding some long subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs with bounded generalized colouring number / rank
 
Normal rank

Revision as of 21:21, 24 July 2024

scientific article; zbMATH DE number 7329526
Language Label Description Also known as
English
Erdös--Hajnal Properties for Powers of Sparse Graphs
scientific article; zbMATH DE number 7329526

    Statements

    Erdös--Hajnal Properties for Powers of Sparse Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 March 2021
    0 references
    graph sparsity
    0 references
    Erdös-Hajnal conjecture
    0 references
    weak coloring numbers
    0 references
    graph power
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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