Extremal numbers of hypergraph suspensions of even cycles
From MaRDI portal
Publication:6201917
DOI10.1016/j.ejc.2024.103935arXiv2101.06743MaRDI QIDQ6201917
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.06743
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)
Cites Work
- Unnamed Item
- Unnamed Item
- On the spectrum of Wenger graphs
- On generalizing generalized polygons
- Finite generalized quadrangles
- Explicit constructions of graphs without short cycles and low density codes
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Polarities and \(2k\)-cycle-free graphs
- On the connectivity of certain graphs of high girth.
- Cycles of even length in graphs
- LDPC codes from triangle-free line sets
- Explicit construction of graphs with an arbitrary large girth and of large size
- A note on inversion of Toeplitz matrices
- On the structure of linear graphs
- Triangles in graphs without bipartite suspensions
- On Arithmetic Progressions of Cycle Lengths in Graphs
- A note on the Turán function of even cycles
- Extremal problems for cycles in graphs
- Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
- Über ein Problem von K. Zarankiewicz
- A new series of dense graphs of high girth
- Constructions of bipartite graphs from finite geometries
- Graphs from Generalized Kac--Moody Algebras
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Minimal Regular Graphs of Girths Eight and Twelve
- On Graphs that do not Contain a Thomsen Graph
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Extremal numbers of hypergraph suspensions of even cycles
