Imagen de Portada

Edge inducibility via local directed graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chao, Ting-Wei, Antonir, Asaf Cohen, Li, Anqi, Yu, Hung-Hsun Hans
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Kruskal--Katona-Type Problems via the Entropy Method
por: Chao, Ting-Wei, et al.
Publicado: (2023)

A Purely Entropic Approach to the Rainbow Triangle Problem
por: Chao, Ting-Wei, et al.
Publicado: (2024)

When does a tree activate the random graph?
por: Antonir, Asaf Cohen, et al.
Publicado: (2025)

On the independence number of de Bruijn graphs
por: Majer, Pietro, et al.
Publicado: (2026)

Generalized graph codes and thier minimum distances
por: Fujii, Naoki
Publicado: (2025)

On the $(k,\ell)$-multiset anonymity measure for social graphs
por: Estrada-Moreno, Alejandro, et al.
Publicado: (2025)

On the stabilizer of the graph of linear functions over finite fields
por: Smaldore, Valentino, et al.
Publicado: (2024)

A Survey on Codes from Simplicial Complexes
por: Wu, Yansheng, et al.
Publicado: (2024)

The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
por: Xiong, Yanzhen, et al.
Publicado: (2026)

Finite field Nikodym problem for spread line sets
por: Chao, Ting-Wei, et al.
Publicado: (2026)

Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
por: Abiad, Aida, et al.
Publicado: (2024)

An example showing that Schrijver's $\vartheta$-function need not upper bound the Shannon capacity of a graph
por: Sason, Igal
Publicado: (2025)

Geometric construction of k-optimal locally repairable codes
por: Fu, Yi, et al.
Publicado: (2026)

Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes
por: Lo, Yuan-Hsun, et al.
Publicado: (2024)

On the size of maximal binary codes with 2, 3, and 4 distances
por: Barg, Alexander, et al.
Publicado: (2022)

On the Number of Subsequences in the Nonbinary Deletion Channel
por: Li, Han, et al.
Publicado: (2026)

When entropy meets Turán: new proofs and hypergraph Turán results
por: Chao, Ting-Wei, et al.
Publicado: (2024)

Reconstructing graphs with subgraph compositions
por: Dailly, Antoine, et al.
Publicado: (2025)

Association schemes arising from non-weakly regular bent functions
por: Wei, Yadi, et al.
Publicado: (2024)

$K_{2,t+1}$-free graphs with many copies of $K_{t,t}$
por: Pohoata, Cosmin, et al.
Publicado: (2026)

Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars
por: Wei, Hengjia, et al.
Publicado: (2024)

Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems
por: Jakhar, Gunank, et al.
Publicado: (2026)

The Closure of LCD-to-GI Reductions via Generalized Inner Products
por: Ishizuka, Keita
Publicado: (2026)

On Duplication-Free Codes for Disjoint or Equal-Length Errors
por: Yu, Wenjun, et al.
Publicado: (2024)

Constrained coding upper bounds via Goulden-Jackson cluster theorem
por: Shen, Yuanting, et al.
Publicado: (2024)

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
por: Brakensiek, Joshua, et al.
Publicado: (2025)

Binary codes from subset inclusion matrices
por: Marin, Alexey D., et al.
Publicado: (2024)

Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
por: Guo, Zeyu, et al.
Publicado: (2026)

On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
por: Yu, Wenjun, et al.
Publicado: (2025)

Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
por: Mossel, Elchanan, et al.
Publicado: (2024)

A further study on the mass formula for linear codes with prescribed hull dimension
por: Li, Shitao, et al.
Publicado: (2024)

Information Inequalities via Ideas from Additive Combinatorics
por: Lau, Chin Wa, et al.
Publicado: (2023)

Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
por: Yu, Wenjun, et al.
Publicado: (2025)

Near-Optimal List-Recovery of Linear Code Families
por: Li, Ray, et al.
Publicado: (2025)

PIR Over Wireless Channels: Achieving Privacy With Public Responses
por: Elimelech, Or, et al.
Publicado: (2025)

On PIR and SPIR Over Gaussian MAC
por: Elimelech, Or, et al.
Publicado: (2024)

Understanding the ratio of the partition sum to its Bethe approximation via double covers
por: Vontobel, Pascal O.
Publicado: (2025)

Constructing rotatable permutations of $\mathbb{F}_{2^m}^3$ with $3$-homogeneous functions
por: Chi, Yunwen, et al.
Publicado: (2024)

Decoding Trombetti-Zhou codes: a new syndrome-based decoding approach
por: Li, Chunlei, et al.
Publicado: (2025)

A Further Investigation on Complete Complementary Codes from $q$-ary Functions
por: Sarkar, Palash, et al.
Publicado: (2024)