The Ramsey number of generalized loose paths in hypergraphs
From MaRDI portal
Publication:898106
DOI10.1016/j.disc.2015.09.023zbMath1327.05231arXiv1305.0294OpenAlexW2147171132MaRDI QIDQ898106
Publication date: 8 December 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.0294
Related Items (6)
The \(H\)-spectra of a class of generalized power hypergraphs ⋮ Test dense subgraphs in sparse uniform hypergraph ⋮ The cyclic index of adjacency tensor of generalized power hypergraphs ⋮ Sharp detection boundaries on testing dense subhypergraph ⋮ Joins of hypergraphs and their spectra ⋮ On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
Cites Work
- Unnamed Item
- Ramsey numbers of 3-uniform loose paths and loose cycles
- The Ramsey number of loose triangles and quadrangles in hypergraphs
- The Ramsey number for hypergraph cycles. I.
- The Ramsey number of diamond-matchings and loose cycles in hypergraphs
- Path-cycle Ramsey numbers
- All Ramsey numbers for cycles in graphs
- The Ramsey number of loose paths in 3-uniform hypergraphs
- The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
This page was built for publication: The Ramsey number of generalized loose paths in hypergraphs