The Ramsey number of loose paths in 3-uniform hypergraphs

zbMath1266.05092arXiv1209.4159MaRDI QIDQ1953390

Leila Maherani, Maryam Shahsiah, Ghaffar Raeisi, Gholam Reza Omidi

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.4159

zbMATH Keywords

Ramsey numberloose cycleloose path

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (12)

Ramsey numbers of uniform loose paths and cycles ⋮ Computing all Laplacian H-eigenvalues for a uniform loose path of length three ⋮ Ramsey numbers of 3-uniform loose paths and loose cycles ⋮ Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs ⋮ Constrained Ramsey numbers for the loose path, cycle and star ⋮ The Ramsey number of generalized loose paths in hypergraphs ⋮ Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues ⋮ Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues ⋮ Finding all H-Eigenvalues of Signless Laplacian Tensor for a Uniform Loose Path of Length Three ⋮ On multicolor Ramsey numbers for loose \(k\)-paths of length three ⋮ Largest adjacency, signless Laplacian, and Laplacian H-eigenvalues of loose paths ⋮ The Ramsey number of 3-uniform loose path versus star

This page was built for publication: The Ramsey number of loose paths in 3-uniform hypergraphs