An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs (Q5364255): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Andrzej Czygrinow / rank
Normal rank
 
Property / author
 
Property / author: Q200923 / rank
Normal rank
 
Property / author
 
Property / author: Andrzej Czygrinow / rank
 
Normal rank
Property / author
 
Property / author: Henry A. Kierstead / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1307.4803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / 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: On directed versions of the Corrádi-Hajnal corollary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of disjoint cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact minimum degree condition for Hamilton cycles in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle packings and 1-factors in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type theorem on equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for equitable coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3656238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the square of a Hamiltonian cycle in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Sumner's universal tournament conjecture for large tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to avoid using the regularity Lemma: Pósa's conjecture revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest digraphs contained in all n-tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent directed triangles in a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Circuits in Graphs<sup>†</sup> / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2162255574 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:54, 30 July 2024

scientific article; zbMATH DE number 6785453
Language Label Description Also known as
English
An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
scientific article; zbMATH DE number 6785453

    Statements

    An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 October 2017
    0 references

    Identifiers