Cover Image

Erdős-Ko-Rado Theorems for Paths in Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bushaw, Neal, Danielsson, James, Hurlbert, Glenn
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C35 (05D05, 05C69)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Erdős-Ko-Rado problem of flags with type $\{1, n-3 \}$ of finite sets
by: Heering, Philipp
Published: (2025)

A Survey of the Holroyd-Talbot Conjecture
by: Hurlbert, Glenn
Published: (2025)

Sets of vertices with extremal energy
by: Bushaw, Neal, et al.
Published: (2024)

Hilton-Milner Theorem for the $r$-independent sets in a union of cliques
by: Gunderson, Karen, et al.
Published: (2025)

Robustness of Erdős--Ko--Rado theorems on permutations and perfect matchings
by: Gunderson, Karen, et al.
Published: (2024)

Diametric problem for permutations with the Ulam metric (optimal anticodes)
by: Devlin, Pat, et al.
Published: (2024)

Solution to a problem of Katona on counting cliques of weighted graphs
by: Borg, Peter, et al.
Published: (2022)

Induced subgraph density. IV. New graphs with the Erdős-Hajnal property
by: Nguyen, Tung, et al.
Published: (2023)

Solution to a problem on isolation of cliques in uniform hypergraphs
by: Borg, Peter
Published: (2025)

The minimum number of maximal independent sets in twin-free graphs
by: Cambie, Stijn, et al.
Published: (2022)

Cliques in Squares of Graphs with Maximum Average Degree less than 4
by: Cranston, Daniel W., et al.
Published: (2023)

A new measure of robustness of Erdős--Ko--Rado Theorems on permutation groups
by: Gunderson, Karen, et al.
Published: (2025)

Maximal independent sets in the middle two layers of the Boolean lattice
by: Balogh, József, et al.
Published: (2025)

A precise condition for independent transversals in bipartite covers
by: Cambie, Stijn, et al.
Published: (2023)

Graphs with unique Grundy dominating sets
by: Brešar, Boštjan, et al.
Published: (2021)

Lower bounds on the independence number of a graph in terms of degrees
by: Harant, Jochen, et al.
Published: (2025)

On the independence number in subcubic graphs
by: Harant, Jochen, et al.
Published: (2025)

How large part of a graph can be covered by the neighborhoods of k vertices?
by: Pach, Janos
Published: (2026)

Dense halves in balanced 2-partition of K4-free graphs
by: Xu, Yue, et al.
Published: (2024)

The next case of Andrásfai's conjecture
by: Łuczak, Tomasz, et al.
Published: (2023)

An Asymptotically Sharp Bound on the Maximum Number of Independent Transversals
by: Ruotolo, Jake, et al.
Published: (2022)

The minimum number of vertices and edges of connected graphs with ind-match$(G) = p$, min-match$(G) = q$ and match$(G) = r$
by: Matsuda, Kazunori, et al.
Published: (2025)

On the number of triangles in $K_4$-free graphs
by: He, Jialin, et al.
Published: (2025)

Minimum spectral radius of graphs of fixed order and dissociation number and its connection to Turán problems
by: Desai, Dheer Noal, et al.
Published: (2025)

Note on extremal problems about connected subgraph sums
by: Cambie, Stijn, et al.
Published: (2025)

The largest sets of non-opposite chambers in spherical buildings of type $B$
by: De Beule, Jan, et al.
Published: (2025)

Extremal problems about the order and size of nonhamiltonian locally linear graphs
by: Liu, Feng, et al.
Published: (2024)

$k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$
by: Cichacz, Sylwia, et al.
Published: (2022)

Solution to a $3$-path isolation problem for subcubic graphs
by: Bartolo, Karl, et al.
Published: (2024)

Induced forests in some distance-regular graphs
by: Gunderson, Karen, et al.
Published: (2023)

Induced subgraph density. III. Cycles and subdivisions
by: Nguyen, Tung, et al.
Published: (2023)

Sparse graphs with an independent or foresty minimum vertex cut
by: Cheng, Kun, et al.
Published: (2024)

Number of independent transversals in multipartite graphs
by: Tang, Yantao, et al.
Published: (2025)

The generalizations of Erdős matching conjecture for $t$-matching number
by: Zhang, Haixiang, et al.
Published: (2025)

Secure coalitions in graphs
by: Shetty, Swathi, et al.
Published: (2025)

Distribution of independent sets in perfect $r$-ary trees
by: Iľkovič, Daniel, et al.
Published: (2026)

On the pebbling numbers of Flower, Blanuša, and Watkins snarks
by: Adauto, Matheus, et al.
Published: (2023)

Graphs with Independent Exact $r$-covers for all $r$
by: Chau, Hou Tin
Published: (2025)

Fractionally colouring $P_5$-free graphs
by: Nguyen, Tung H.
Published: (2025)

Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
by: Cambie, Stijn, et al.
Published: (2023)