Cover Image

Counting oriented trees in digraphs with large minimum semidegree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Joos, Felix, Schrodt, Jonathan
Format:	Preprint
Published:	2023
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Subgraphs with a positive minimum semidegree in digraphs with large outdegree
by: Grzesik, Andrzej, et al.
Published: (2024)

Hitting times in the binomial random graph
by: Granet, Bertille, et al.
Published: (2024)

Two-block paths in oriented graphs of large semidegree
by: Penev, Irena, et al.
Published: (2025)

Alternating paths in oriented graphs with large semidegree
by: Skokan, Jozef, et al.
Published: (2024)

Counting tight Hamilton cycles in Dirac hypergraphs
by: Joos, Felix, et al.
Published: (2026)

Oriented trees in digraphs with large girth
by: Lu, Junying, et al.
Published: (2025)

Oriented trees and paths in digraphs
by: Stein, Maya
Published: (2023)

Hamilton cycles in random digraphs with minimum degree at least one
by: Cooper, Colin, et al.
Published: (2023)

Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
by: DeBiasio, Louis, et al.
Published: (2025)

Edge disjoint Hamilton cycles in random digraphs of constant minimum degree
by: Cooper, Colin, et al.
Published: (2026)

On the Prague dimension of sparse random graphs
by: Joos, Felix, et al.
Published: (2025)

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

Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)

Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
by: Liu, Chun-Hung, et al.
Published: (2024)

The hypergraph removal process
by: Joos, Felix, et al.
Published: (2024)

Unavoidable subgraphs in digraphs with large out-degrees
by: Hons, Tomáš, et al.
Published: (2025)

On the Adjacency spectra of alternating-oriented $n$-gonal staircase digraphs
by: Minamide, Hiroki
Published: (2026)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)

The large $N$ factorization does not hold for arbitrary multi-trace observables in random tensors
by: Gurau, Razvan, et al.
Published: (2025)

Normal trees of digraphs
by: Reich, Florian
Published: (2024)

Conflict-free Hypergraph Matchings and Coverings
by: Joos, Felix, et al.
Published: (2024)

Subdivisions in dicritical digraphs with large order or digirth
by: Picasarri-Arrieta, Lucas, et al.
Published: (2024)

Some families of graphs, hypergraphs and digraphs defined by systems of equations
by: Lazebnik, Felix, et al.
Published: (2025)

On Hamiltonian bypasses in digraphs and bipartite digraphs
by: Darbinyan, Samvel Kh.
Published: (2025)

Counting degree-constrained orientations
by: Yu, Jing, et al.
Published: (2025)

The minimum orientable genus of the repeated Cartesian product of graphs
by: Galea, Marietta, et al.
Published: (2024)

Paths with two blocks in oriented graphs of large minimum semi-degree
by: Chen, Bin, et al.
Published: (2025)

Unavoidable butterfly minors in digraphs of large cycle rank
by: Hatzel, Meike, et al.
Published: (2025)

On the minimum number of eigenvalues of trees of diameter seven
by: Allem, Luiz Emilio, et al.
Published: (2025)

Sufficient conditions for perfect mixed tilings
by: Hurley, Eoin, et al.
Published: (2022)

Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
by: Arras, Patrick, et al.
Published: (2024)

How many times can two minimum spanning trees cross?
by: Antić, Todor, et al.
Published: (2026)

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

Embedding trees using minimum and maximum degree conditions
by: Pokrovskiy, Alexey, et al.
Published: (2025)

On the random minimum edge-disjoint spanning trees problem
by: Shabanov, Dmitry, et al.
Published: (2025)

Compatible Hamilton cycles in graphs with large minimum degree
by: Behague, Natalie, et al.
Published: (2026)

Antidirected trees in dense digraphs
by: Stein, Maya, et al.
Published: (2024)

On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)

Distant digraph domination
by: Nguyen, Tung, et al.
Published: (2024)

Distance ideals of digraphs
by: Alfaro, Carlos A., et al.
Published: (2024)