Matches in SemOpenAlex for { <https://semopenalex.org/work/W4287330897> ?p ?o ?g. }
Showing items 1 to 47 of
47
with 100 items per page.
- W4287330897 abstract "Lov'asz and Cherkassky discovered in the 1970s independently that if $ G $ is a finite graph with a given set $ T $ of terminal vertices such that $ G $ is inner Eulerian, then the maximal number of edge-disjoint paths connecting distinct vertices in $ T $ is $ sum_{tin T}lambda(t, T-t) $ where $lambda $ is the local edge-connectivity function. The optimality of a system of edge-disjoint $ T $-paths in the Lov'asz-Cherkassky theorem is witnessed by the existence of certain cuts by Menger's theorem. The infinite generalisation of Menger's theorem by Aharoni and Berger (earlier known as the ErdH{o}s-Menger Conjecture) together with the characterization of infinite Eulerian graphs due to Nash-Williams makes it possible to generalise the theorem for infinite graphs in a structural way. The aim of this paper is to formulate this generalisation and prove it for countable graphs." @default.
- W4287330897 created "2022-07-25" @default.
- W4287330897 creator A5021133588 @default.
- W4287330897 date "2021-02-08" @default.
- W4287330897 modified "2023-09-26" @default.
- W4287330897 title "The Lov'asz-Cherkassky theorem in countable graphs" @default.
- W4287330897 doi "https://doi.org/10.48550/arxiv.2102.04203" @default.
- W4287330897 hasPublicationYear "2021" @default.
- W4287330897 type Work @default.
- W4287330897 citedByCount "0" @default.
- W4287330897 crossrefType "posted-content" @default.
- W4287330897 hasAuthorship W4287330897A5021133588 @default.
- W4287330897 hasBestOaLocation W42873308971 @default.
- W4287330897 hasConcept C110729354 @default.
- W4287330897 hasConcept C114614502 @default.
- W4287330897 hasConcept C118615104 @default.
- W4287330897 hasConcept C202444582 @default.
- W4287330897 hasConcept C2780990831 @default.
- W4287330897 hasConcept C33923547 @default.
- W4287330897 hasConcept C43058520 @default.
- W4287330897 hasConcept C45340560 @default.
- W4287330897 hasConcept C53469067 @default.
- W4287330897 hasConceptScore W4287330897C110729354 @default.
- W4287330897 hasConceptScore W4287330897C114614502 @default.
- W4287330897 hasConceptScore W4287330897C118615104 @default.
- W4287330897 hasConceptScore W4287330897C202444582 @default.
- W4287330897 hasConceptScore W4287330897C2780990831 @default.
- W4287330897 hasConceptScore W4287330897C33923547 @default.
- W4287330897 hasConceptScore W4287330897C43058520 @default.
- W4287330897 hasConceptScore W4287330897C45340560 @default.
- W4287330897 hasConceptScore W4287330897C53469067 @default.
- W4287330897 hasLocation W42873308971 @default.
- W4287330897 hasOpenAccess W4287330897 @default.
- W4287330897 hasPrimaryLocation W42873308971 @default.
- W4287330897 hasRelatedWork W1535012554 @default.
- W4287330897 hasRelatedWork W2017973453 @default.
- W4287330897 hasRelatedWork W2050911484 @default.
- W4287330897 hasRelatedWork W2052907214 @default.
- W4287330897 hasRelatedWork W2624013591 @default.
- W4287330897 hasRelatedWork W2766457447 @default.
- W4287330897 hasRelatedWork W2952208190 @default.
- W4287330897 hasRelatedWork W2963699585 @default.
- W4287330897 hasRelatedWork W3161232744 @default.
- W4287330897 hasRelatedWork W4366828361 @default.
- W4287330897 isParatext "false" @default.
- W4287330897 isRetracted "false" @default.
- W4287330897 workType "article" @default.