:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kupavskii, Andrey, Pach, Janos
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	https://arxiv.org/abs/2511.20047
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Intersecting families with covering number $3$
by: Kupavskii, Andrey
Published: (2024)

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
by: Dumitrescu, Adrian, et al.
Published: (2024)

Delta-system method: a survey
by: Kupavskii, Andrey
Published: (2025)

Erd\H os--Ko--Rado type results for partitions via spread approximations
by: Kupavskii, Andrey
Published: (2023)

Structure of non-trivial intersecting families
by: Kupavskii, Andrey
Published: (2024)

An almost complete $t$-intersection theorem for permutations
by: Kupavskii, Andrey
Published: (2024)

Note on the Number of Almost Ordinary Triangles
by: Dumitrescu, Adrian, et al.
Published: (2025)

A complete $t$-intersection theorem for families of spanning trees
by: Iarovikova, Elizaveta, et al.
Published: (2025)

Satisfying sequences for rainbow partite matchings
by: Kupavskii, Andrey, et al.
Published: (2025)

The Hajnal--Rothschild problem
by: Frankl, Peter, et al.
Published: (2025)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
by: Kupavskii, Andrey, et al.
Published: (2025)

Frankl's diversity theorem for permutations
by: Inozemtsev, Eduard, et al.
Published: (2026)

Two questions on Kneser colorings
by: Inozemtsev, Eduard, et al.
Published: (2024)

Families without $s$-matchings: the other end
by: Kupavskii, Andrey, et al.
Published: (2026)

More on the Erd\H os--Kleitman problem on matchings in set families
by: Kupavskii, Andrey, et al.
Published: (2026)

Stability for binary scalar products
by: Kupavskii, Andrey, et al.
Published: (2024)

Covering Complete Geometric Graphs by Monotone Paths
by: Dumitrescu, Adrian, et al.
Published: (2025)

Matchings in permutations
by: Inozemtsev, Eduard, et al.
Published: (2026)

On the Vertices of Delta-modular Polyhedra
by: Mikhail, Bludov, et al.
Published: (2025)

On graphs coverable by chubby shortest paths
by: Hatzel, Meike, et al.
Published: (2025)

Computational complexity of covering regular trees
by: Bok, Jan, et al.
Published: (2025)

$θ$-free matching covered graphs
by: Joshi, Rohinee, et al.
Published: (2024)

Beyond recognizing well-covered graphs
by: Feghali, Carl, et al.
Published: (2024)

Facial diagrams and cycle double cover
by: Ghanbari, Babak, et al.
Published: (2026)

Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
by: Soltani, Hossein, et al.
Published: (2018)

New bounds for the optimal density of covering single-insertion codes via the Turán density
by: Pikhurko, Oleg, et al.
Published: (2024)

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
by: Mozhui, Khyodeno, et al.
Published: (2025)

The Non-Cancelling Intersections Conjecture
by: Amarilli, Antoine, et al.
Published: (2024)

Approximate cycle double cover
by: Ghanbari, Babak, et al.
Published: (2025)

Curves, points, incidences and covering
by: Bishnu, Arijit, et al.
Published: (2025)

A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
by: Pham, Huy Tuan
Published: (2024)

Non-Promise Version of Unique Sink Orientations
by: Marques, Tiago Oliveira
Published: (2024)

Non-detectable patterns hidden within sequences of bits
by: Allen, David, et al.
Published: (2024)

Non-empty intersection of longest paths in $H$-free graphs
by: Long Jr., James A., et al.
Published: (2023)

Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
by: Burke, Kyle, et al.
Published: (2024)

Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra
by: Dakhno, Grigorii, et al.
Published: (2024)