Subgraphs with a positive minimum semidegree in digraphs with large outdegree
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F25%3A00386436" target="_blank" >RIV/68407700:21240/25:00386436 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.5802/igt.14" target="_blank" >https://doi.org/10.5802/igt.14</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.5802/igt.14" target="_blank" >10.5802/igt.14</a>
Alternative languages
Result language
angličtina
Original language name
Subgraphs with a positive minimum semidegree in digraphs with large outdegree
Original language description
We prove that every n-vertex directed graph G with the minimum outdegree delta+(G) = d contains a subgraph H satisfying min(delta+(H), delta-(H)) >= d(d+1)/(2n). We also show that if d = o(n) then this bound is asymptotically best possible.
Czech name
—
Czech description
—
Classification
Type
J<sub>ost</sub> - Miscellaneous article in a specialist periodical
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GM23-06815M" target="_blank" >GM23-06815M: Extremal and probabilistic combinatorics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Innovations in Graph Theory
ISSN
3050-743X
e-ISSN
3050-743X
Volume of the periodical
2
Issue of the periodical within the volume
11
Country of publishing house
FR - FRANCE
Number of pages
12
Pages from-to
301-312
UT code for WoS article
—
EID of the result in the Scopus database
—