Cover Image

Digraph Branchings and Matrix Determinants

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ghosh, Sayani, Meyer, Bradley S.
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Burning Graph Powers and Branching Trees
by: Jansson, Jesper, et al.
Published: (2026)

Branch-depth is minor closure of contraction-deletion-depth
by: Briański, Marcin, et al.
Published: (2024)

On the Gap between Hereditary Discrepancy and the Determinant Lower Bound
by: Li, Lily, et al.
Published: (2023)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)

Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
by: Eze, L. C., et al.
Published: (2025)

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

Restricted CSPs and F-free Digraph Algorithmics
by: Guzmán-Pro, Santiago, et al.
Published: (2025)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
by: Kunisky, Dmitriy, et al.
Published: (2024)

Christoffel Matrices and Sturmian Determinants
by: Reutenauer, Christophe, et al.
Published: (2024)

Determining the Outerthickness of Graphs Is NP-Hard
by: Lee, Pin-Hsian, et al.
Published: (2026)

Balanced-chromatic number and Hadwiger-like conjectures
by: Jiménez, Andrea, et al.
Published: (2023)

Coloring Grids Avoiding Bicolored Paths
by: Keskinkilic, Derman, et al.
Published: (2023)

Extremal digraphs for open neighbourhood location-domination and identifying codes
by: Foucaud, Florent, et al.
Published: (2023)

Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)

Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023)

Cop numbers of periodic graphs
by: De Carufel, Jean-Lou, et al.
Published: (2023)

Constrained Flows in Networks
by: Bessy, Stéphane, et al.
Published: (2023)

Coboundary and cosystolic expansion without dependence on dimension or degree
by: Dikstein, Yotam, et al.
Published: (2023)

The Excluded Tree Minor Theorem Revisited
by: Dujmović, Vida, et al.
Published: (2023)

Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
by: Dvořák, Pavel, et al.
Published: (2023)

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
by: Pépin, Martin, et al.
Published: (2023)

Primal-Dual Cops and Robber
by: Ha, Minh Tuan, et al.
Published: (2023)

Bounding the chromatic number of dense digraphs by arc neighborhoods
by: Klingelhoefer, Felix, et al.
Published: (2023)

List homomorphisms to separable signed graphs
by: Bok, Jan, et al.
Published: (2023)

Winding number and circular 4-coloring of signed graphs
by: Gujgiczer, Anna, et al.
Published: (2023)

Critical exponent of binary words with few distinct palindromes
by: Dvořáková, L'ubomíra, et al.
Published: (2023)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)

Chemically inspired Erdős-Rényi oriented hypergraphs
by: Garcia-Chung, Angel, et al.
Published: (2023)

The Frank number and nowhere-zero flows on graphs
by: Goedgebeur, Jan, et al.
Published: (2023)

Boundary rigidity of finite CAT(0) cube complexes
by: Chalopin, Jérémie, et al.
Published: (2023)

Obstruction characterization of co-TT graphs
by: Das, Ashok Kumar, et al.
Published: (2023)

Maximal Cliques in Scale-Free Random Graphs
by: Bläsius, Thomas, et al.
Published: (2023)

Redicolouring digraphs: directed treewidth and cycle-degeneracy
by: Nisse, Nicolas, et al.
Published: (2023)

Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)

Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$
by: Picasarri-Arrieta, Lucas, et al.
Published: (2023)