Constructions of bipartite graphs from finite geometries
From MaRDI portal
Publication:4680400
DOI10.1002/jgt.20059zbMath1062.05073OpenAlexW4240480644MaRDI QIDQ4680400
Keith E. Mellinger, Dhruv Mubayi
Publication date: 1 June 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20059
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Combinatorial aspects of finite geometries (05B25)
Related Items (12)
Graphs without theta subgraphs ⋮ On the spectrum of Wenger graphs ⋮ Graphs with few paths of prescribed length between any two vertices ⋮ Extremal numbers of hypergraph suspensions of even cycles ⋮ A Bound on the Number of Edges in Graphs Without an Even Cycle ⋮ Some combinatorial aspects of constructing bipartite-graph codes ⋮ Fault tolerant approximate BFS structures with additive stretch ⋮ On some cycles in Wenger graphs ⋮ A note on the spectrum of linearized Wenger graphs ⋮ Extremal Numbers of Cycles Revisited ⋮ A note on the Turán function of even cycles ⋮ Linearized Wenger graphs
Cites Work
This page was built for publication: Constructions of bipartite graphs from finite geometries
