Clique immersion in graphs without a fixed bipartite graph (Q2171024): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph Coloring and the Immersion Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Graphs with No Immersion of Large Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum degree condition forcing complete graph immersion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immersing small complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete graph immersions and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing clique immersions through chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological cliques in graphs II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minors in expanding graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete minors in \(K_{s,s}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Mader's conjecture on large clique subdivisions in C4-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors XXIII. Nash-Williams' immersion conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank

Latest revision as of 04:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Clique immersion in graphs without a fixed bipartite graph
scientific article

    Statements

    Clique immersion in graphs without a fixed bipartite graph (English)
    0 references
    0 references
    0 references
    0 references
    23 September 2022
    0 references
    graph immersions
    0 references
    average degree
    0 references
    sublinear expander
    0 references

    Identifiers

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