Extremal number of arborescences

DOI10.37236/13517MaRDI QIDQ6864216zbMATH OpenFDO

Authors Aditya Bandekar, Péter Csikvári, Benjamin Mascuch, Damján Tárkányi, Márton Telekes, Lilla Tóthmérész

Publication date 4 February 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13517

zbMATH Keywords

Eulerian graphnumber of arborescences of an Eulerian orientation

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• \(R\)-systems
• A course in combinatorics.
• A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
• A note on skew-symmetric determinants
• Algebraic multiplicity of the eigenvalues of a tournament matrix
• Arborescences of covering graphs
• Arithmetic aspects of symmetric edge polytopes
• Decomposing and colouring some locally semicomplete digraphs
• Degrees of interior polynomials and parking function enumerators
• Doubly regular tournaments are equivalent to skew Hadamard matrices
• Enumerative problems for arborescences and monotone paths on polytope graphs
• Graph theory
• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 3047763 (Why is no real title available?)
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• Many faces of symmetric edge polytopes
• On a generalization of symmetric edge polytopes to regular matroids
• On the number of 4-cycles in a tournament
• Roots of Ehrhart polynomials arising from graphs
• Spanning trees in regular graphs

This page was built for publication: Extremal number of arborescences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864216)