The Turán number of directed paths and oriented cycles
From MaRDI portal
Publication:2701405
DOI10.1007/s00373-023-02647-7OpenAlexW4362721603MaRDI QIDQ2701405
Publication date: 28 April 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02647-7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of \(C_{2\ell}\)-free graphs
- Digraphs that have at most one walk of a given length with the same endpoints
- Extremal graphs without 4-cycles
- New sufficient conditions for cycles in graphs
- The strong perfect graph theorem
- An upper bound for the Turán number \(t_3(n,4)\)
- Properties of certain families of \(2k\)-cycle-free graphs
- The size of bipartite graphs with a given girth
- Path Ramsey numbers in multicolorings
- What we know and what we do not know about Turán numbers
- On product representation of powers. I
- A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
- Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints
- Extremal digraphs avoiding an orientation of the diamond
- Extremal digraphs avoiding an orientation of \(C_4\)
- Extremal problems for directed graphs
- Graph Theory
- A note on the Turán function of even cycles
- Asymptotic Improvements to the Lower Bound of Certain Bipartite Turán Numbers
- Extremal problems for cycles in graphs
- Extremal Combinatorics
- Über ein Problem von K. Zarankiewicz
- On maximal paths and circuits of graphs
- An extremal problem for some classes of oriented graphs
- Graphs without four-cycles
- On the maximum number of arcs in some classes of graphs
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- A Note on Bipartite Graphs Without 2 k -Cycles
- On the number of edge-disjoint triangles in \(K_4\)-free graphs
This page was built for publication: The Turán number of directed paths and oriented cycles
