:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Frankl, Peter, Kupavskii, Andrey
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	https://arxiv.org/abs/2502.06699
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Delta-system method: a survey
por: Kupavskii, Andrey
Publicado: (2025)

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

Structure of non-trivial intersecting families
por: Kupavskii, Andrey
Publicado: (2024)

Intersecting families with covering number $3$
por: Kupavskii, Andrey
Publicado: (2024)

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

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

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

Non-dissective coverings by planks
por: Kupavskii, Andrey, et al.
Publicado: (2025)

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

Two questions on Kneser colorings
por: Inozemtsev, Eduard, et al.
Publicado: (2024)

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

Stability for binary scalar products
por: Kupavskii, Andrey, et al.
Publicado: (2024)

Matchings in permutations
por: Inozemtsev, Eduard, et al.
Publicado: (2026)

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

Three aspects of the MSTCI problem
por: Dubinsky, Manuel, et al.
Publicado: (2023)

The red-blue-yellow matching problem
por: Aprile, Manuel, et al.
Publicado: (2026)

A note on the Alon-Saks-Seymour problem
por: Fox, Jacob
Publicado: (2026)

On rigid regular graphs and a problem of Babai and Pultr
por: Knauer, Kolja, et al.
Publicado: (2025)

On three domination-based identification problems in block graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2018)

Note about the complexity of the acyclic orientation with parity constraint problem
por: Gravier, Sylvain, et al.
Publicado: (2025)

A note on the distinct distances problem over finite fields
por: Brukhim, Nataly, et al.
Publicado: (2025)

Filling some gaps on the edge coloring problem of split graphs
por: Couto, Fernanda, et al.
Publicado: (2024)

Some polynomial classes for the acyclic orientation with parity constraint problem
por: Gravier, Sylvain, et al.
Publicado: (2026)

Intersection problems and a correlation inequality for integer sequences
por: Frankl, Peter, et al.
Publicado: (2024)

New small regular graphs of given girth: the cage problem and beyond
por: Exoo, Geoffrey, et al.
Publicado: (2025)

The sandwich problem for odd-hole-free and even-hole-free graphs
por: Cameron, Kathie, et al.
Publicado: (2024)

Families of tractable problems with respect to vertex-interval-membership width and its generalisations
por: Enright, Jessica, et al.
Publicado: (2025)

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

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

Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates
por: Falgas-Ravry, Victor, et al.
Publicado: (2022)

A bound for the cops and robber problem in terms of 2-component order connectivity
por: Jain, Suryaansh, et al.
Publicado: (2024)

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

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
por: Choi, Mujin, et al.
Publicado: (2025)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
por: Kurapov, Sergey, et al.
Publicado: (2024)

Near-optimal edge partitioning via intersecting families
por: Yakunin, Alexander, et al.
Publicado: (2025)

Boundedness and Separation in the Graph Covering Number Framework
por: Goetze, Miriam, et al.
Publicado: (2025)

The strong chromatic index of $K_{t,t}$-free graphs
por: Bi, Richard, et al.
Publicado: (2026)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
por: Tiskin, Alexander
Publicado: (2022)