Tight cycles in hypergraphs (Q322350)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Tight cycles in hypergraphs (English)

0 references

0 references

0 references

publication date

14 October 2016

0 references

zbMATH Keywords

hypergraphs

0 references

tight cycles

0 references

regularity method

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://arxiv.org/pdf/1411.4957

0 references

Tight cycles in hypergraphs

0 references

Pancyclic graphs. I

0 references

Hamiltonicity in balanced \(k\)-partite graphs

0 references

On maximal paths and circuits of graphs

0 references

Hypergraph extensions of the Erdős-Gallai theorem

0 references

On Hamiltonian bipartite graphs

0 references

0 references

An approximate Dirac-type theorem for \(k\)-uniform hypergraphs

0 references

Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.ENDM.2015.06.091

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:322350

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q322350&oldid=38304813"