---
res:
  bibo_abstract:
  - "A tantalizing open problem, posed independently by Stiebitz in 1995 and by Alon
    in 1996 and again in 2006, asks whether for every pair of integers  s,t≥1 there
    exists a finite number  F(s,t)\r\nsuch that the vertex set of every digraph of
    minimum out-degree at least  F(s,t) can be partitioned into non-empty parts  A
    \ and  B  such that the subdigraphs induced on  A\r\n  and  B  have minimum out-degree
    at least  s  and  t , respectively.\r\nIn this short note, we prove that if  F(2,2)
    \ exists, then all the numbers  F(s,t)  with  s,t≥1\r\n  exist and satisfy  F(s,t)=Θ(s+t)
    . In consequence, the problem of Alon and Stiebitz reduces to the case  s=t=2
    . Moreover, the numbers  F(s,t)  with  s,t≥2  either all exist and grow linearly,
    or all of them do not exist.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Micha
      foaf_name: Christoph, Micha
      foaf_surname: Christoph
  - foaf_Person:
      foaf_givenName: Kalina H
      foaf_name: Petrova, Kalina H
      foaf_surname: Petrova
      foaf_workInfoHomepage: http://www.librecat.org/personId=554ff4e4-f325-11ee-b0c4-a10dbd523381
  - foaf_Person:
      foaf_givenName: Raphael
      foaf_name: Steiner, Raphael
      foaf_surname: Steiner
  bibo_doi: 10.1017/S0963548325000045
  bibo_issue: '4'
  bibo_volume: 34
  dct_date: 2025^xs_gYear
  dct_identifier:
  - UT:001449245700001
  dct_isPartOf:
  - http://id.crossref.org/issn/0963-5483
  - http://id.crossref.org/issn/1469-2163
  dct_language: eng
  dct_publisher: Cambridge University Press@
  dct_title: A note on digraph splitting@
...