Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3209002032 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2012.03686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: VC-dimension and Erdős-Pósa property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of uniform convergence of frequencies of events to their probabilities and problems of search for an optimal solution from empirical data / 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: Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in <i>H</i>-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Hajnal conjecture for bull-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraphs of graphs with large chromatic number. III: Long holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the Gyárfás-Sumner conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a New Separator Theorem for String Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density theorems for bipartite graphs and related Ramsey-type results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large induced sparse subgraphs in <i> c <sub>&gt;t</sub> </i> -free graphs in quasipolynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the hypergraph of maximal cliques of a graph with no long path / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree width, bramble size, and expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radius two trees specify χ‐bounded classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings on graphs and game coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3333070 / 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: String graphs. I: The number of critical nonstring graphs is infinite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separators in region intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Separators in String Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential-time algorithms for finding large induced sparse subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential algorithms for variants of the homomorphism problem in string graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of χ‐boundedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem; stability and order for models and theories in infinitary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: In absence of long chordless cycles, large tree-width becomes a local phenomenon / rank
 
Normal rank

Latest revision as of 06:11, 27 July 2024

scientific article
Language Label Description Also known as
English
Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
scientific article

    Statements

    Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2021
    0 references
    \(P_t\)-free graphs
    0 references
    \(C_{\geqslant t}\)-free graphs
    0 references
    \(\chi\)-boundedness
    0 references
    biclique
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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