Cover Image

Almost all $C_k$-free oriented graphs have $Θ(n)$ backwards edges

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Jianxi, Liang, Meili
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Almost all 9-regular graphs have a modulo-5 orientation
by: Delcourt, Michelle, et al.
Published: (2022)

Dense $2$-connected planar graphs and the planar Turán number of $2C_k$
by: Li, Ping
Published: (2025)

Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles
by: Lo, Allan, et al.
Published: (2023)

List-$k$-Coloring $H$-free graphs for all $k>4$
by: Chudnovsky, Maria, et al.
Published: (2023)

The typical structure of oriented graphs and digraphs with forbidden blow-up of transitive tournaments
by: Liu, Jianxi
Published: (2026)

Almost all cographs have a cospectral mate
by: Wang, Wei, et al.
Published: (2025)

The Planar Turán Number of $Θ_6$-graphs
by: Guan, David, et al.
Published: (2024)

Almost all standard double covers of abelian Cayley graphs have smallest possible automorphism groups
by: Xia, Binzhou, et al.
Published: (2026)

Almost all graphs have no cospectral mate with fixed level
by: Wang, Wei, et al.
Published: (2025)

On $\overrightarrow{C_{n}}$-irregular oriented graphs
by: Dovzhenok, Tatiana, et al.
Published: (2025)

Dense triangle-free $(n, d, λ)$-graphs for all orders
by: Kim, Jaehoon, et al.
Published: (2024)

A container theorem for general digraphs with forbidden subdigraphs
by: Liang, Meili, et al.
Published: (2026)

K_4-free graphs have sparse halves
by: Reiher, Christian
Published: (2021)

On degree power sum in $P_k$-free graphs
by: Ai, Jiangdong, et al.
Published: (2024)

Almost-perfect colorful matchings in three-edge-colored bipartite graphs
by: Boyadzhiyska, Simona, et al.
Published: (2025)

Improved bound on the number of edges of diameter-$k$-critical graphs
by: Wang, Xiaolin, et al.
Published: (2024)

Almost all graphs have no cospectral mates with height relative small to its order
by: Zhao, Da
Published: (2026)

A note on edge colorings distinguishing all triangles in a graph
by: Pilsniak, Monika, et al.
Published: (2024)

$k$-edge geodetic graphs
by: Guragain, Satyam, et al.
Published: (2024)

On $k$-colorability of $(bull, H)$-free graphs
by: Hodur, Nadzieja, et al.
Published: (2025)

A strong structural stability of $C_{2k+1}$-free graphs
by: Yan, Zilong, et al.
Published: (2024)

Counterexamples to a conjecture on graph inertia
by: Chen, Hongzhang, et al.
Published: (2026)

Longest odd cycles in non-bipartite $C_{2k+1}$-free graphs
by: Wang, Rui, et al.
Published: (2025)

Counting the parts divisible by k in all the partitions of n whose parts have multiplicity less than k
by: Herden, Daniel, et al.
Published: (2020)

On the complexity of edge subdivision to $H$-free graphs
by: Piecyk, Marta, et al.
Published: (2026)

The number of cut-edges and conflict-free connection number in planar graphs
by: Ha, Pham Hoang, et al.
Published: (2026)

Injective edge-coloring of claw-free graphs with maximum degree 4
by: Huang, Danjun, et al.
Published: (2025)

On the unicyclic graphs having vertices that belong to all their (strong) metric bases
by: Hakanen, Anni, et al.
Published: (2022)

Matching powers of monomial ideals and edge ideals of weighted oriented graphs
by: Erey, Nursel, et al.
Published: (2023)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
by: Das, Sandip, et al.
Published: (2023)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)

Hitting all maximum stable sets in $P_5$-free graphs
by: Hajebi, Sepehr, et al.
Published: (2023)

The planar Turán number of $\{K_4,Θ_5\}$
by: Fang, Tao
Published: (2024)

On graphs which have locally complete 2-edge-colourings and their relationship to proper circular-arc graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2024)

Characterizing all $K_4$-free well-edge-dominated graphs of girth 3
by: Anderson, Sarah E., et al.
Published: (2025)

Triangle-free $d$-degenerate graphs have small fractional chromatic number
by: Martinsson, Anders
Published: (2025)

Dominating Hadwiger's Conjecture holds for all $2K_2$-free graphs
by: Song, Zi-Xia, et al.
Published: (2025)

4K_1 free graphs on 13 vertices have cop number at most 2
by: Wu, Zhaoyu
Published: (2026)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)