Cover Image

Note on Long Directed Cycles in Eulerian Digraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ai, Jiangdong, Gutin, Gregory, He, Fankang, Yeo, Anders
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
by: Ai, Jiangdong, et al.
Published: (2024)

Feedback vertex sets of digraphs with bounded maximum degree
by: Ai, Jiangdong, et al.
Published: (2025)

Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
by: Ai, Jiangdong, et al.
Published: (2025)

Solution on strong partition of $2$-balanced regular multipartite tournaments
by: Ai, Jiangdong, et al.
Published: (2024)

Odd Induced Subgraphs in Graphs of Maximum Degree Four
by: Ai, Jiangdong, et al.
Published: (2025)

Lower Bounds for Maximum Weighted Cut
by: Gutin, Gregory, et al.
Published: (2021)

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
by: Jiangdong Ai, et al.
Published: (2025)

On high discrepancy $1$-factorizations of complete graphs
by: Ai, Jiangdong, et al.
Published: (2025)

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

Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition
by: Ai, Jiangdong, et al.
Published: (2025)

A complete characterization of split digraphs with a strong arc decomposition
by: Ai, Jiangdong, et al.
Published: (2024)

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
by: Gerke, Stefanie, et al.
Published: (2024)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
by: Gutin, Gregory, et al.
Published: (2024)

Feedback Arc Sets and Feedback Arc Set Decompositions in Weighted and Unweighted Oriented Graphs
by: Gutin, Gregory, et al.
Published: (2025)

Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
by: Gerke, S., et al.
Published: (2026)

Cutoff for the inversion walk on tournaments and the state space of restricted inversions
by: Ai, Jiangdong
Published: (2026)

Hamilton Powers of Eulerian Digraphs
by: Colón, Enrico Celestino, et al.
Published: (2022)

Forward Arc Maximization for Hamilton Oriented Cycles and Paths in Generalizations of Tournaments
by: Guo, Q., et al.
Published: (2026)

Majority Edge Colouring of Hypergraph
by: Ai, Jiangdong, et al.
Published: (2025)

Refinements of Alon-Babai-Suzuki-type intersection theorems via non-shadows and binomial support
by: Ai, Jiangdong, et al.
Published: (2026)

Arc-disjoint Steiner Cycles in Digraphs
by: Bai, Jie, et al.
Published: (2026)

Covering Random Digraphs with Hamilton Cycles
by: Ferber, Asaf, et al.
Published: (2024)

Partitions of an Eulerian Digraph into Circuits
by: Cooper, Joshua, et al.
Published: (2025)

Subdivisions of Oriented Cycles in Digraphs with Hamiltonian directed path
by: Alhakim, Abbas, et al.
Published: (2024)

Judicious Partitions in Edge-Weighted Graphs with Bounded Maximum Weighted Degree
by: Gutin, G., et al.
Published: (2025)

A variable version of the quasi-kernel conjecture
by: Ai, Jiangdong, et al.
Published: (2024)

Maximizing the Steklov eigenvalues on trees with a diameter constraint
by: Ai, Jiangdong, et al.
Published: (2026)

Note on the size of a stable matching
by: Gutin, Gregory Z., et al.
Published: (2025)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)

Graph operations and a unified method for kinds of Turán-type problems on paths, cycles and matchings
by: Ai, Jiangdong, et al.
Published: (2023)

Effect of edge-stretching on Steklov eigenvalues and sharp Steklov eigenvalue bounds on leaf--boundary trees
by: Ai, Jiangdong, et al.
Published: (2026)

Arc-disjoint in- and out-branchings in semicomplete split digraphs
by: Ai, Jiangdong, et al.
Published: (2024)

A weighted cycle-localization inequality
by: Ai, Jiangdong, et al.
Published: (2026)

On a weaker notion of cross $t$-intersecting families
by: Ai, Jiangdong, et al.
Published: (2026)

A short note on spanning even trees
by: Ai, Jiangdong, et al.
Published: (2024)

Eulerian Directed Multigraphs
by: Silberger, Donald
Published: (2024)

Constructing edge-disjoint Steiner trees in Cartesian product networks
by: Li, Rui, et al.
Published: (2023)

Cordiality of Digraphs
by: Beasley, Leroy, et al.
Published: (2021)

Piercing independent sets in graphs without large induced matching
by: Ai, Jiangdong, et al.
Published: (2024)

Słupecki Digraphs
by: Kunos, Ádám, et al.
Published: (2024)