Tight cycles in hypergraphs (Q322350): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: M. Dambrine / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C65 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6639433 / rank
 
Normal rank
Property / zbMATH Keywords
 
hypergraphs
Property / zbMATH Keywords: hypergraphs / rank
 
Normal rank
Property / zbMATH Keywords
 
tight cycles
Property / zbMATH Keywords: tight cycles / rank
 
Normal rank
Property / zbMATH Keywords
 
regularity method
Property / zbMATH Keywords: regularity method / rank
 
Normal rank
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://arxiv.org/pdf/1411.4957 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2175669756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight cycles in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity in balanced \(k\)-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph extensions of the Erdős-Gallai theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3078214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate Dirac-type theorem for \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:27, 12 July 2024

scientific article
Language Label Description Also known as
English
Tight cycles in hypergraphs
scientific article

    Statements

    Identifiers