:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Czédli, Gábor
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 06C05, 05C21
Online Access:	https://arxiv.org/abs/2406.15989
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generating subspace lattices, their direct products, and their direct powers
by: Czédli, Gábor
Published: (2024)

Equivalence of labeled graphs and lattices
by: Bhavale, Ashok Nivrutti
Published: (2025)

An 8-flow theorem for signed graphs
by: Luo, Rong, et al.
Published: (2024)

On removable edge subsets in graphs with a nowhere-zero $4$-flow
by: Mattiolo, Davide
Published: (2025)

The nucleus of the Grassmann graph $J_q(N,D)$
by: Lee, Jae-Ho, et al.
Published: (2025)

Nowhere-zero $3$-flows in Cayley graphs on solvable groups of twice square-free order
by: Ahanjideh, Milad, et al.
Published: (2026)

Cubic graphs of colouring defect 3 and conjectures of Berge and Alon-Tarsi
by: Karabáš, Ján, et al.
Published: (2025)

Extended Abstract: Canonical join complex and cubical coordinates for all framing lattices
by: Berggren, Jonah, et al.
Published: (2026)

On hybrid order dimension
by: Andrikopoulos, Athanasios
Published: (2020)

On the strong metric dimension of the zero-divisor graph of a lattice
by: Gadge, Pravin, et al.
Published: (2024)

On divisibility relation graphs
by: Merzel, Jonathan L., et al.
Published: (2025)

A note on the sizes of bipartite 1-planar graphs
by: Wang, Guiping
Published: (2025)

On the strong metric dimension of the complement of the zero-divisor graph of a lattice
by: Gadge, Pravin, et al.
Published: (2025)

Sparsity of 3-flow critical graphs
by: Dvořák, Zdeněk, et al.
Published: (2024)

Efficiently distinguishing all tangles in locally finite graphs
by: Jacobs, Raphael W., et al.
Published: (2023)

Gracefulness of two nested cycles: a first approach
by: Licona, Miguel, et al.
Published: (2024)

Geometric description of $d$-dimensional flows of a graph
by: Mattiolo, Davide, et al.
Published: (2025)

Simplifying modular lattices by removing doubly irreducible elements
by: Kohonen, Jukka
Published: (2023)

Nowhere-zero 8-flows in 3-edge-connected signed graphs
by: DeVos, Matt, et al.
Published: (2025)

Bouchet's conjecture for cyclically 5-edge-connected, cubic signed graphs
by: Nurse, Kathryn
Published: (2026)

A numeral system for the middle-levels graphs
by: Dejter, Italo J.
Published: (2010)

The Pinnacle Sets of a Graph
by: Bozeman, Chassidy, et al.
Published: (2024)

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

On better-quasi-ordering under graph minors
by: Georgakopoulos, Agelos
Published: (2025)

On the $f$-vectors of flow polytopes for the complete graph
by: Dugan, William T.
Published: (2024)

Cyclically $5$-edge-connected snarks with resistance $2$ and flow resistance $n$
by: Mattiolo, Davide, et al.
Published: (2026)

Counting Flows of $b$-compatible Graphs
by: Fu, Houshan, et al.
Published: (2024)

The Rhodes semilattice of a biased graph
by: Gottstein, Michael J., et al.
Published: (2023)

Resonance graphs of plane bipartite graphs as daisy cubes
by: Brezovnik, Simon, et al.
Published: (2023)

Trees of tangles in abstract separation systems
by: Elbracht, Christian, et al.
Published: (2019)

Planar Graphs with Homomorphisms to the 9-cycle
by: Cranston, Daniel W., et al.
Published: (2024)

All-to-all Routing on Kautz Graphs: Regular Routing Beats Shortest Paths
by: Faber, Vance, et al.
Published: (2026)

Spanning plane subgraphs of $1$-plane graphs
by: Noguchi, Kenta, et al.
Published: (2024)

On non-planar, cycle-conformal graphs
by: Gorsky, Maximilian, et al.
Published: (2026)

Reinterpreting the Middle-Levels Theorem via Natural Enumeration of Ordered Trees
by: Dejter, Italo J.
Published: (2019)

Two-count interval representation of a permutation
by: Biró, Csaba, et al.
Published: (2024)

The length polyhedron of an interval order
by: Biró, Csaba, et al.
Published: (2024)

Extensions of Real-Weighted Fractional Arboricity
by: Moxley, Rowan
Published: (2025)

The path-missing and path-free complexes of a directed graph
by: Grinberg, Darij, et al.
Published: (2021)

On the characterization of graphs with tree 3-spanners
by: Lin, Lan, et al.
Published: (2025)