Cover Image

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ai, Jiangdong, Gutin, Gregory, Lei, Hui, Yeo, Anders, Zhou, Yacong
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics
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: Jiangdong Ai, et al.
Published: (2025)

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

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

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
by: Gerke, Stefanie, 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)

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

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

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

Characterizing Large Clique Number in Tournaments
by: Crew, Logan, et al.
Published: (2026)

Note on Long Directed Cycles in Eulerian Digraphs
by: Ai, Jiangdong, et al.
Published: (2025)

Digraph Branchings and Matrix Determinants
by: Ghosh, Sayani, et al.
Published: (2023)

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

The Complexity of Color-constrained Paths in Semicomplete Multipartite Digraphs
by: Brinkmann, Julian
Published: (2025)

Acyclic dichromatic number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2025)

Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'
by: Anand, Bijo S., et al.
Published: (2025)

Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
by: Spirkl, Sophie, et al.
Published: (2026)

On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs
by: D'Elia, Marco, et al.
Published: (2026)

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
by: D'Elia, Marco, et al.
Published: (2024)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
by: Goetze, Miriam, et al.
Published: (2024)

Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
by: Dumitrescu, Adrian, et al.
Published: (2024)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)

Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
by: Srinivasan, Eshwar, et al.
Published: (2025)

Towards Transitive-free Digraphs
by: Abhinav, Ankit, et al.
Published: (2025)

Bears with Hats and Independence Polynomials
by: Blažej, Václav, et al.
Published: (2021)

Transducing Linear Decompositions of Tournaments
by: Geniet, Colin, et al.
Published: (2026)

$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
by: la Tour, Max Dupré, et al.
Published: (2024)

Polynomial Bounds in the Apex Minor Theorem
by: Hendrey, Kevin, et al.
Published: (2025)

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
by: Pitois, François, et al.
Published: (2022)

Basis Number and Pathwidth
by: Miraftab, Babak, et al.
Published: (2026)

From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
by: Gurvits, Leonid, et al.
Published: (2023)

On the Cop Number of String Graphs
by: Das, Sandip, et al.
Published: (2024)

Sums of $k$-bonacci Numbers
by: Parks, Harold R., et al.
Published: (2022)

Separation Number and Treewidth, Revisited
by: Houdrouge, Hussein, et al.
Published: (2025)

Polynomial-time recognition and maximum independent set in Burling graphs
by: Rzążewski, Paweł, et al.
Published: (2024)

Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
by: Chen, Yeyuan
Published: (2024)

A Demigod's Number for the Rubik's Cube
by: Merino, Arturo, et al.
Published: (2024)

Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)

Proper Rainbow Saturation Numbers for Cycles
by: Halfpap, Anastasia, et al.
Published: (2024)