scientific article; zbMATH DE number 3630786
From MaRDI portal
Publication:4192089
Cited in
(70)- A note on approximate Nash equilibria
- Triangle packings and 1-factors in oriented graphs
- Color degree and alternating cycles in edge-colored graphs
- The 2-linkage problem for acyclic digraphs
- A note on minimal directed graphs with given girth
- Short cycles in digraphs
- Directed triangles in digraphs
- Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
- Some approaches to a conjecture on short cycles in digraphs
- Total domination and the Caccetta-Häggkvist conjecture
- Proof of the Caccetta-Häggkvist conjecture for digraphs with small independence number
- 3-free strong digraphs with the maximum size
- Properly colored short cycles in edge-colored graphs
- Extending some results on the second neighborhood conjecture
- Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
- Turán number of 3-free strong digraphs with out-degree restriction
- Vertex-disjoint rainbow cycles in edge-colored graphs
- Concatenating bipartite graphs
- Short directed cycles in bipartite digraphs
- Seymour's second neighborhood conjecture for 6-antitransitive digraphs
- Mixed cages
- Cyclic triangle factors in regular tournaments
- On the co-degree threshold for the Fano plane
- Rainbow triangles in edge-colored graphs
- On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity
- A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture
- On Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
- Short cycles in oriented graphs
- On the Caccetta-Häggkvist conjecture with forbidden subgraphs
- Seymour's second neighborhood conjecture for tournaments missing a generalized star
- Tournaments and Semicomplete Digraphs
- Domination in digraphs
- The number of Seymour vertices in random tournaments and digraphs
- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two
- Color degree and heterochromatic cycles in edge-colored graphs
- Semantic limits of dense combinatorial objects
- On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament
- Colorful Flowers
- scientific article; zbMATH DE number 2230268 (Why is no real title available?)
- A note on short cycles in digraphs
- Directed triangles in directed graphs
- Short rainbow cycles in graphs and matroids
- Rainbow cycles for families of matchings
- Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
- Choice functions
- On Seymour's and Sullivan's second neighbourhood conjectures
- On Multicolor Ramsey Numbers of Triple System Paths of Length 3
- Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture
- Path-monochromatic bounded depth rooted trees in (random) tournaments
- Degree conditions forcing oriented cycles
- Notes on Aharoni's rainbow cycle conjecture
- Bounds on the acyclic disconnection of a digraph
- Short rainbow cycles for families of matchings and triangles
- Subgraphs with a positive minimum semidegree in digraphs with large outdegree
- Short rainbow cycles for families of small edge sets
- Rainbow triangles sharing one common vertex or edge
- Aharoni's rainbow cycle conjecture holds up to an additive constant
- Seymour's second neighbourhood conjecture: random graphs and reductions
- A new bound for a particular case of the Caccetta-Häggkvist conjecture
- Properly colored cycles in edge-colored balanced bipartite graphs
- A note on the second neighborhood problem for k-anti-transitive digraphs with large girth
- Short cycles in directed graphs
- Rainbow cycles in edge-colored graphs
- Hoàng-Reed conjecture holds for tournaments
- Cycles in dense digraphs
- Cycles of given length in oriented graphs
- Counting paths in digraphs
- The Hoàng-Reed conjecture for \(\delta ^{+}=3\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4192089)