Imagen de Portada

Exact values and improved bounds on $k$-neighborly families of boxes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cheng, Xinbu, Wang, Meiqin, Xu, Zixiang, Yip, Chi Hoi
Formato:	Preprint
Publicado:	2023
Materias:	Combinatorics 05C70
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Exact values and improved bounds on the clique number of cyclotomic graphs
por: Yip, Chi Hoi
Publicado: (2023)

Bollobás-Erdős-Tuza conjecture for graphs with no induced $K_{s,t}$
por: Cheng, Xinbu, et al.
Publicado: (2024)

Paley-type matrices and $1$-factorizations of complete graphs
por: Yip, Chi Hoi, et al.
Publicado: (2026)

Intersective sets over abelian groups
por: Xu, Zixiang, et al.
Publicado: (2022)

Exact values for unbalanced Zarankiewicz numbers
por: Chen, Guangzhou, et al.
Publicado: (2022)

Sublinear hitting sets for some geometric graphs
por: Cheng, Xinbu, et al.
Publicado: (2024)

Restricted sumsets in multiplicative subgroups
por: Yip, Chi Hoi
Publicado: (2023)

Two lower bounds for maximum matching
por: Kuyanov, Fedor
Publicado: (2024)

Spectral radius and k-factor-critical graphs
por: Zhou, Sizhong, et al.
Publicado: (2023)

On the k-spanning cyclability of 4-valent Cayley graphs on Abelian groups
por: Alspach, Brian, et al.
Publicado: (2024)

Spectral radius and perfect k-matchings in t-connected graphs
por: Pan, Quanru, et al.
Publicado: (2026)

Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs
por: Gao, Yongbin, et al.
Publicado: (2026)

Spanning k-trees and distance spectral radius in graphs
por: Zhou, Sizhong, et al.
Publicado: (2023)

A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
por: Abreu, M., et al.
Publicado: (2024)

A note on the $k$-defect number: Vertex Coloring with a Fixed Number of Monochromatic Edges
por: Mphako-Banda, Eunice, et al.
Publicado: (2025)

Sufficient conditions for a graph with minimum degree to be k-critical with respect to [1,b]-odd factor
por: Zhou, Sizhong
Publicado: (2025)

RSB bounds on the maximum cut
por: Harangi, Viktor
Publicado: (2025)

Spanning k-trees, odd [1,b]-factors and spectral radius in binding graphs
por: Wu, Jiancheng, et al.
Publicado: (2025)

Decomposition of Cliques into $k$-Star-Forests
por: Nie, Jiaxi, et al.
Publicado: (2025)

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

Claw-free minimal matching covered graphs
por: Zhang, Yipei, et al.
Publicado: (2024)

Sperner systems with restricted differences
por: Xu, Zixiang, et al.
Publicado: (2022)

The Frankl-Pach upper bound is not tight for any uniformity
por: Ge, Gennian, et al.
Publicado: (2024)

A necessary and sufficient condition for bounds on the sum of a list of real numbers and its applications
por: Yang, Xiwu
Publicado: (2024)

Spanning $H$-subdivisions and perfect $H$-subdivision tilings in dense digraphs
por: Cheng, Yangyang, et al.
Publicado: (2024)

A Dirac-type theorem for arbitrary Hamiltonian $H$-linked digraphs
por: Cheng, Yangyang, et al.
Publicado: (2024)

A lower bound on forcing numbers based on height functions
por: Aliyev, Fateh, et al.
Publicado: (2024)

A SAT-based Filtering Framework for Exact Coverings of K33 by Cliques of Order 3, 4 or 5
por: Kovař, Petr, et al.
Publicado: (2026)

Distance spectral radius for a graph to be k-critical with respect to [1,b]-odd factor
por: Wang, Sufang, et al.
Publicado: (2025)

Lower bounds for the Randić index in terms of matching number
por: Akbari, Saieed, et al.
Publicado: (2024)

Some results on the k-strong parity property in a graph
por: Wu, Jie
Publicado: (2025)

The minimum degree of minimal $k$-factor-critical claw-free graphs*
por: Guo, Jing, et al.
Publicado: (2023)

Covering the edges of a graph with perfect matchings
por: Silina, Olha
Publicado: (2023)

Odd Covers of Complete Graphs and Hypergraphs
por: Leader, Imre, et al.
Publicado: (2024)

A Discrete Logarithm Construction for Orthogonal Double Covers of the Complete Graph by Hamiltonian Paths
por: Ollis, M. A.
Publicado: (2025)

Grid designs
por: Danai, Alon, et al.
Publicado: (2026)

Almost-perfect colorful matchings in three-edge-colored bipartite graphs
por: Boyadzhiyska, Simona, et al.
Publicado: (2025)

Generating simple near-bipartite bricks
por: Kothari, Nishad, et al.
Publicado: (2017)

Balanced 1-Factorisations of 3- and 4-Regular Circulant Graphs
por: Mitchell, Jeremy
Publicado: (2024)

Tight Bounds for Cycle-Edge Decompositions and Covers
por: Akbari, Saieed, et al.
Publicado: (2025)