Results 31 to 40 of about 1,490 (70)
Extremal results on feedback arc sets in digraphs
Random Structures &Algorithms, Volume 64, Issue 2, Page 287-308, March 2024.Abstract For an oriented graph G$$ G $$, let β(G)$$ \beta (G) $$ denote the size of a minimum feedback arc set, a smallest edge subset whose deletion leaves an acyclic subgraph. Berger and Shor proved that any m$$ m $$‐edge oriented graph G$$ G $$ satisfies β(G)=m/2−Ω(m3/4)$$ \beta (G)=m/2-\Omega \left({m}^{3/4}\right) $$.
Jacob Fox, Zoe Himwich, Nitya Mani
wiley +1 more source
Oriented paths in n-chromatic digraphs [PDF]
, 2010 In this thesis, we try to treat the problem of oriented paths in n-chromatic digraphs. We first treat the case of antidirected paths in 5-chromatic digraphs, where we explain El-Sahili's theorem and provide an elementary and shorter proof of it.
Nasser, Rajai
core +2 more sources
A note on forbidding clique immersions [PDF]
, 2012 Robertson and Seymour proved that the relation of graph immersion is well-quasi-ordered for finite graphs. Their proof uses the results of graph minors theory.
DeVos, Matt +3 more
core
Directed strongly walk-regular graphs
, 2017 We generalize the concept of strong walk-regularity to directed graphs. We call a digraph strongly $\ell$-walk-regular with $\ell >1$ if the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are the
Omidi, Gholamreza, van Dam, Edwin R.
core +1 more source
A Dirac type result on Hamilton cycles in oriented graphs
, 2008 We show that for each \alpha>0 every sufficiently large oriented graph G with \delta^+(G),\delta^-(G)\ge 3|G|/8+ \alpha |G| contains a Hamilton cycle. This gives an approximate solution to a problem of Thomassen.
Kelly, Luke +2 more
core +1 more source
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Algorithmica, 2023 Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
Sombor index of directed graphs. [PDF]
Heliyon, 2022 Cruz R, Monsalve J, Rada J.
europepmc +1 more source
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Order (Dordr), 2023 Couceiro M, Duffus D.
europepmc +1 more source
Embedding large subgraphs into dense graphs
, 2009 What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect matchings are generalized by
Kühn, Daniela, Osthus, Deryk
core +1 more source
A new model for predicting the winner in tennis based on the eigenvector centrality. [PDF]
Ann Oper Res, 2023 Arcagni A, Candila V, Grassi R.
europepmc +1 more source