A Cantor-Bernstein-type theorem for spanning trees in infinite graphs (Q2033907): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Max F. Pitz / rank
Normal rank
 
Property / author
 
Property / author: Max F. Pitz / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3122641440 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1907.09338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite, highly connected digraphs with no two arc-disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The colouring number of infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of infinite graphs. I: Bond-faithful decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary submodels in infinite combinatorics / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:23, 26 July 2024

scientific article
Language Label Description Also known as
English
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
scientific article

    Statements

    A Cantor-Bernstein-type theorem for spanning trees in infinite graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 June 2021
    0 references
    spanning trees
    0 references
    colouring number
    0 references
    packing
    0 references
    covering
    0 references

    Identifiers