On tight tree-complete hypergraph Ramsey numbers

DOI10.1002/JGT.70054MaRDI QIDQ7303142zbMATH OpenFDO

Authors Jiaxi Nie

Publication date 23 July 2026

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.70054

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Hypergraphs (05C65) Ramsey theory (05D10)

Cites work

• Exact solution of some Turán-type problems
• scientific article; zbMATH DE number 4014740 (Why is no real title available?)
• scientific article; zbMATH DE number 3545699 (Why is no real title available?)
• scientific article; zbMATH DE number 3258067 (Why is no real title available?)
• Hypergraphs not containing a tight tree with a bounded trunk
• Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2
• Note on independent sets in steiner systems
• Sparse hypergraphs with low independence number
• The probabilistic method
• Tight paths in convex geometric hypergraphs

This page was built for publication: On tight tree-complete hypergraph Ramsey numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7303142)