Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs (Q3553234): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.20427 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4248569100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly connected monochromatic subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic Hamiltonian<i>t</i>-tight Berge-cycles in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey Number for 3-Uniform Tight Hypergraph Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:04, 2 July 2024

scientific article
Language Label Description Also known as
English
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
scientific article

    Statements

    Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 April 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamiltonian
    0 references
    Berge-cycle
    0 references
    hypergraph
    0 references
    0 references