Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version (Q1689892): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
aliases / en / 0aliases / en / 0
 
Loose Hamiltonian cycles forced by large $(k-2)$-degree - sharp version
description / endescription / en
scientific article
scientific article; zbMATH DE number 7032108
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1409.05142 / rank
 
Normal rank
Property / author
 
Property / author: Josefran de Oliveira Bastos / rank
 
Normal rank
Property / publication date
 
5 March 2019
Timestamp+2019-03-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 5 March 2019 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://cdm.ucalgary.ca/article/view/62730 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7032108 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2614047805 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1705.03707 / rank
 
Normal rank
Property / arXiv classification
 
math.CO
Property / arXiv classification: math.CO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamiltonian cycles forced by \((k-2)\)-degree -- approximate version / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dirac-type results for loose Hamilton cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian chains in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton \(\ell \)-cycles in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3078214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs / 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: Recent advances on Dirac-type problems for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidding just one intersection / rank
 
Normal rank

Latest revision as of 10:40, 18 July 2024

scientific article; zbMATH DE number 7032108
  • Loose Hamiltonian cycles forced by large $(k-2)$-degree - sharp version
Language Label Description Also known as
English
Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
scientific article; zbMATH DE number 7032108
  • Loose Hamiltonian cycles forced by large $(k-2)$-degree - sharp version

Statements

Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version (English)
0 references
0 references
0 references
0 references
0 references
18 January 2018
0 references
5 March 2019
0 references
hypergraphs
0 references
Hamiltonian cycles
0 references
degree conditions
0 references
math.CO
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references