On the existence of regular n-graphs with given girth

DOI10.1016/S0021-9800(70)80021-7MaRDI QIDQ5600751zbMATH OpenOpenAlexFDO

Authors Norbert Sauer

Publication date 1970

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

Full work available at URL https://doi.org/10.1016/s0021-9800(70)80021-7

Cited in

(9)

• Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number
• Dense graphs have \(K_{3,t}\) minors
• High girth hypergraphs with unavoidable monochromatic or rainbow edges
• Constructions of sparse uniform hypergraphs with high chromatic number
• Girth of sparse graphs
• Random constructions of hypergraphs with large girth and without panchromatic colorings
• On the density of triangles and squares in regular finite and unimodular random graphs
• Vertex colorings of graphs without short odd cycles
• 2-colorings of hypergraphs with large girth

This page was built for publication: On the existence of regular n-graphs with given girth

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