On the existence of regular n-graphs with given girth
From MaRDI portal
Publication:5600751
DOI10.1016/S0021-9800(70)80021-7zbMath0201.56903OpenAlexW2035153155MaRDI QIDQ5600751
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
Related Items
Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number, Random constructions of hypergraphs with large girth and without panchromatic colorings, 2-colorings of hypergraphs with large girth, On the density of triangles and squares in regular finite and unimodular random graphs, Dense graphs have \(K_{3,t}\) minors, Constructions of sparse uniform hypergraphs with high chromatic number, Vertex colorings of graphs without short odd cycles, Girth of sparse graphs, High girth hypergraphs with unavoidable monochromatic or rainbow edges
