Graphs with few paths of prescribed length between any two vertices
From MaRDI portal
Publication:5110588
DOI10.1112/blms.12295zbMath1442.05047arXiv1411.0856OpenAlexW3100868007WikidataQ126994613 ScholiaQ126994613MaRDI QIDQ5110588
Publication date: 21 May 2020
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.0856
Related Items (21)
Many Turán exponents via subdivisions ⋮ On Turán exponents of bipartite graphs ⋮ Graphs without theta subgraphs ⋮ On the Extremal Number of Subdivisions ⋮ Some extremal results on hypergraph Turán problems ⋮ Some remarks on the Zarankiewicz problem ⋮ Balanced supersaturation for some degenerate hypergraphs ⋮ Bipartite-ness under smooth conditions ⋮ Random polynomial graphs for random Turán problems ⋮ On the Turán Number of Generalized Theta Graphs ⋮ Random multilinear maps and the Erd\H{o}s box problem ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ More on the extremal number of subdivisions ⋮ General lemmas for Berge-Turán hypergraph problems ⋮ Repeated Patterns in Proper Colorings ⋮ On the rational Turán exponents conjecture ⋮ Turán Numbers of Bipartite Subdivisions ⋮ Hypergraphs with Few Berge Paths of Fixed Length between Vertices ⋮ Extremal Numbers of Cycles Revisited ⋮ Turán numbers of theta graphs ⋮ The extremal number of longer subdivisions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turán numbers for \(K_{s,t}\)-free graphs: topological obstructions and algebraic constructions
- On a class of degenerate extremal graph problems
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Norm-graphs: Variations and applications
- Graphs without theta subgraphs
- Cycles of even length in graphs
- Explicit construction of graphs with an arbitrary large girth and of large size
- Norm-graphs and bipartite Turán numbers
- Random algebraic construction of extremal graphs
- A new series of dense graphs of high girth
- Constructions of bipartite graphs from finite geometries
- Minimal Regular Graphs of Girths Eight and Twelve
- On Minimal graphs of maximum even girth
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- Number of Points of Varieties in Finite Fields
- On the structure of linear graphs
This page was built for publication: Graphs with few paths of prescribed length between any two vertices
