:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Erde, Joshua, Gollin, Pascal, Joó, Attila, Knappe, Paul, Pitz, Max
Format:	Preprint
Published:	2019
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/1910.05601
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
by: Erde, Joshua, et al.
Published: (2019)

Wild generalised truncation of infinite matroids
by: Gollin, J. Pascal, et al.
Published: (2025)

Circuit-partition of infinite matroids
by: Bowler, Nathan, et al.
Published: (2024)

Circuits through prescribed edges
by: Knappe, Paul, et al.
Published: (2018)

Finite matchability under the matroidal Hall's condition
by: Joó, Attila
Published: (2023)

Matchings in the hypercube with specified edges
by: Erde, Joshua
Published: (2024)

Linked tree-decompositions into finite parts
by: Albrechtsen, Sandra, et al.
Published: (2024)

Counterexamples regarding linked and lean tree-decompositions of infinite graphs
by: Albrechtsen, Sandra, et al.
Published: (2024)

Hilbert polynomials for finitary matroids
by: Fornasiero, Antongiulio, et al.
Published: (2022)

Matroid intersection and packing/covering conjectures are true in the class of finitary matroids
by: Alam, Irfan
Published: (2025)

The strong Nash-Williams orientation theorem for rayless graphs
by: Pitz, Max, et al.
Published: (2024)

The evolution of the permutahedron
by: Collares, Maurício, et al.
Published: (2024)

Hindrance from a wasteful common independent set
by: Joó, Attila
Published: (2025)

Hindrance from a wasteful partial linkage
by: Joó, Attila
Published: (2024)

A Note on Matching Variables to Equations
by: Joó, Attila
Published: (2024)

A metrization theorem for edge-end spaces of infinite graphs
by: Pitz, Max
Published: (2025)

A note on uncountably chromatic graphs
by: Bowler, Nathan, et al.
Published: (2024)

A note on the width of sparse random graphs
by: Do, Tuan Anh, et al.
Published: (2022)

The global structure of locally chordal graphs
by: Abrishami, Tara, et al.
Published: (2025)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

A representation theorem for end spaces of infinite graphs
by: Kurkofka, Jan, et al.
Published: (2021)

Counting independent sets in expanding bipartite regular graphs
by: Collares, Maurício, et al.
Published: (2025)

Long cycles in percolated expanders
by: Collares, Maurício, et al.
Published: (2024)

Large matchings and nearly spanning, nearly regular subgraphs of random subgraphs
by: Diskin, Sahar, et al.
Published: (2024)

Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs
by: Collares, Maurício, et al.
Published: (2024)

All graphs are majority 3-choosable
by: Ouborny, Jan, et al.
Published: (2025)

Well-order a flame
by: Jankó, Zsuzsanna, et al.
Published: (2026)

Obstructions for normally spanned sets of vertices
by: Lorenz, Nicola, et al.
Published: (2025)

Representations of infinite tree-sets
by: Gollin, J. Pascal, et al.
Published: (2019)

On order-compatible paths in infinite graphs
by: Pitz, Max, et al.
Published: (2026)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
by: Gollin, J. Pascal, et al.
Published: (2023)

Linear bounds on treewidth in terms of excluded planar minors
by: Gollin, J. Pascal, et al.
Published: (2024)

The isomorphism problem for reduced finitary power monoids
by: Rago, Balint
Published: (2026)

A short proof of a central limit theorem for the order of the giant component and $k$-core
by: Anastos, Michael, et al.
Published: (2025)

Majority bootstrap percolation on the permutahedron and other high-dimensional graphs
by: Collares, Maurício, et al.
Published: (2025)

The Nash-Williams orientation theorem for graphs with countably many ends
by: Assem, Amena, et al.
Published: (2023)

Nearly spanning cycle in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

Cycle lengths in the percolated hypercube
by: Anastos, Michael, et al.
Published: (2025)

The list chromatic number of the intersection of two generalized partition matroids
by: Guo, He
Published: (2024)

Optimally building spanning graphs in semirandom graph processes
by: Anastos, Michael, et al.
Published: (2025)