{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1962047","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1962047","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1962047","kernelVersion":"v1","immutable":true,"modified":"2026-01-01T18:17:03Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1962047","name":"Subtrees of bipartite digraphs---the minimum degree condition","headline":"Subtrees of bipartite digraphs---the minimum degree condition","description":"scientific article; zbMATH DE number 1395015","url":"https://portal.mardi4nfdi.de/entity/Q1962047","datePublished":"2000-03-20","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q237466"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q96294"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/S0166-218X(99)00137-7","url":"https://doi.org/10.1016/S0166-218X(99)00137-7"},"sameAs":["https://doi.org/10.1016/S0166-218X(99)00137-7"],"comment":"A digraph \\(T\\) without symmetric arcs is said to be an oriented tree if the graph obtained from \\(T\\) by replacing arcs by edges is a tree. Let \\(\\delta^+(D),\\delta^-(D), \\Delta^+(D)\\) denote respectively the minimum outdegree, minimum indegree and maximum outdegree of \\(D.\\) The author shows that if \\(\\min\\{\\delta^+(D),\\delta^-(D), \\Delta^+(D)-1\\}\\geq k-2,\\) then \\(D\\) contains every oriented tree with \\(k\\) vertices (Theorem 4). Let \\(D\\) be a bipartite digraph with \\(V(D)=X\\cup Y\\) and \\(X\\cap Y=\\varnothing.\\) Two sharp conditions guaranteeing that \\(D\\) contains every oriented tree of order \\(k\\) are found:   (1) \\(\\min\\{\\delta^+_X(D),\\delta^-_Y(D)\\}\\geq k-1\\) and \\(\\min\\{\\delta^-_X(D),\\delta^+_Y(D)\\}\\geq\\lfloor\\frac{k-1}2\\rfloor;\\)    (2) \\(\\min\\{\\delta^+_X(D),\\delta^-_X(D)\\}\\geq k-1\\) and \\(\\min\\{\\delta^+_Y(D),\\delta^-_Y(D)\\}\\geq\\lfloor\\frac k2\\rfloor.\\)","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q923098"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1165864"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1328385"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3907598"}]},"provenance":{"prov:generatedAtTime":"2026-01-01T18:17:03Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}