Embedding clique-factors in graphs with low \(\ell\)-independence number (Q6038592): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: \(H\)-factors in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some exact Ramsey-Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Ramsey-Turán numbers of graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle factors of graphs without large independent sets and of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many random edges make a dense graph hamiltonian? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Ramsey-Turán type problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors in randomly perturbed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal number of independent circuits in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: F$F$‐factors in Quasi‐random Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ramsey - Turan type theorems for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More results on Ramsey-Turán type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average number of spanning trees in sparse graphs with given degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of General Graph Factor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multipartite Hajnal-Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time perfect matchings in dense hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K_r\)-factors in graphs with low independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling Turán theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Alon-Yuster conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle Factors in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding large subgraphs into dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum degree threshold for perfect graph packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(F\)-factors in hypergraphs via absorption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tripartite version of the Corrádi-Hajnal theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadripartite version of the Hajnal-Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: FORCING QUASIRANDOMNESS WITH TRIANGLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in large uniform hypergraphs with large minimum collective degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a tiling conjecture of Komlós / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-Turán theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Directed Versions of the Hajnal–Szemerédi Theorem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:53, 1 August 2024

scientific article; zbMATH DE number 7681182
Language Label Description Also known as
English
Embedding clique-factors in graphs with low \(\ell\)-independence number
scientific article; zbMATH DE number 7681182

    Statements

    Embedding clique-factors in graphs with low \(\ell\)-independence number (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 May 2023
    0 references
    0 references
    \(H\)-factor
    0 references
    regularity method
    0 references
    absorbing method
    0 references
    Ramsey-Turán problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references