Edge inducibility via local directed graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Chao, Ting-Wei, Antonir, Asaf Cohen, Li, Anqi, Yu, Hung-Hsun Hans |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Kruskal--Katona-Type Problems via the Entropy Method
by: Chao, Ting-Wei, et al.
Published: (2023)
by: Chao, Ting-Wei, et al.
Published: (2023)
A Purely Entropic Approach to the Rainbow Triangle Problem
by: Chao, Ting-Wei, et al.
Published: (2024)
by: Chao, Ting-Wei, et al.
Published: (2024)
When does a tree activate the random graph?
by: Antonir, Asaf Cohen, et al.
Published: (2025)
by: Antonir, Asaf Cohen, et al.
Published: (2025)
On the independence number of de Bruijn graphs
by: Majer, Pietro, et al.
Published: (2026)
by: Majer, Pietro, et al.
Published: (2026)
Generalized graph codes and thier minimum distances
by: Fujii, Naoki
Published: (2025)
by: Fujii, Naoki
Published: (2025)
On the $(k,\ell)$-multiset anonymity measure for social graphs
by: Estrada-Moreno, Alejandro, et al.
Published: (2025)
by: Estrada-Moreno, Alejandro, et al.
Published: (2025)
On the stabilizer of the graph of linear functions over finite fields
by: Smaldore, Valentino, et al.
Published: (2024)
by: Smaldore, Valentino, et al.
Published: (2024)
A Survey on Codes from Simplicial Complexes
by: Wu, Yansheng, et al.
Published: (2024)
by: Wu, Yansheng, et al.
Published: (2024)
The constructions of Singleton-optimal locally repairable codes with minimum distance 6 and locality 3
by: Xiong, Yanzhen, et al.
Published: (2026)
by: Xiong, Yanzhen, et al.
Published: (2026)
Finite field Nikodym problem for spread line sets
by: Chao, Ting-Wei, et al.
Published: (2026)
by: Chao, Ting-Wei, et al.
Published: (2026)
Eigenvalue bounds for the distance-$t$ chromatic number of a graph and their application to Lee codes
by: Abiad, Aida, et al.
Published: (2024)
by: Abiad, Aida, et al.
Published: (2024)
An example showing that Schrijver's $\vartheta$-function need not upper bound the Shannon capacity of a graph
by: Sason, Igal
Published: (2025)
by: Sason, Igal
Published: (2025)
Geometric construction of k-optimal locally repairable codes
by: Fu, Yi, et al.
Published: (2026)
by: Fu, Yi, et al.
Published: (2026)
Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes
by: Lo, Yuan-Hsun, et al.
Published: (2024)
by: Lo, Yuan-Hsun, et al.
Published: (2024)
On the size of maximal binary codes with 2, 3, and 4 distances
by: Barg, Alexander, et al.
Published: (2022)
by: Barg, Alexander, et al.
Published: (2022)
On the Number of Subsequences in the Nonbinary Deletion Channel
by: Li, Han, et al.
Published: (2026)
by: Li, Han, et al.
Published: (2026)
When entropy meets Turán: new proofs and hypergraph Turán results
by: Chao, Ting-Wei, et al.
Published: (2024)
by: Chao, Ting-Wei, et al.
Published: (2024)
Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)
by: Dailly, Antoine, et al.
Published: (2025)
Association schemes arising from non-weakly regular bent functions
by: Wei, Yadi, et al.
Published: (2024)
by: Wei, Yadi, et al.
Published: (2024)
$K_{2,t+1}$-free graphs with many copies of $K_{t,t}$
by: Pohoata, Cosmin, et al.
Published: (2026)
by: Pohoata, Cosmin, et al.
Published: (2026)
Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars
by: Wei, Hengjia, et al.
Published: (2024)
by: Wei, Hengjia, et al.
Published: (2024)
Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems
by: Jakhar, Gunank, et al.
Published: (2026)
by: Jakhar, Gunank, et al.
Published: (2026)
The Closure of LCD-to-GI Reductions via Generalized Inner Products
by: Ishizuka, Keita
Published: (2026)
by: Ishizuka, Keita
Published: (2026)
On Duplication-Free Codes for Disjoint or Equal-Length Errors
by: Yu, Wenjun, et al.
Published: (2024)
by: Yu, Wenjun, et al.
Published: (2024)
Constrained coding upper bounds via Goulden-Jackson cluster theorem
by: Shen, Yuanting, et al.
Published: (2024)
by: Shen, Yuanting, et al.
Published: (2024)
From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
by: Brakensiek, Joshua, et al.
Published: (2025)
by: Brakensiek, Joshua, et al.
Published: (2025)
Binary codes from subset inclusion matrices
by: Marin, Alexey D., et al.
Published: (2024)
by: Marin, Alexey D., et al.
Published: (2024)
Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
by: Guo, Zeyu, et al.
Published: (2026)
by: Guo, Zeyu, et al.
Published: (2026)
On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
by: Yu, Wenjun, et al.
Published: (2025)
by: Yu, Wenjun, et al.
Published: (2025)
Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs
by: Mossel, Elchanan, et al.
Published: (2024)
by: Mossel, Elchanan, et al.
Published: (2024)
A further study on the mass formula for linear codes with prescribed hull dimension
by: Li, Shitao, et al.
Published: (2024)
by: Li, Shitao, et al.
Published: (2024)
Information Inequalities via Ideas from Additive Combinatorics
by: Lau, Chin Wa, et al.
Published: (2023)
by: Lau, Chin Wa, et al.
Published: (2023)
Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
by: Yu, Wenjun, et al.
Published: (2025)
by: Yu, Wenjun, et al.
Published: (2025)
Near-Optimal List-Recovery of Linear Code Families
by: Li, Ray, et al.
Published: (2025)
by: Li, Ray, et al.
Published: (2025)
PIR Over Wireless Channels: Achieving Privacy With Public Responses
by: Elimelech, Or, et al.
Published: (2025)
by: Elimelech, Or, et al.
Published: (2025)
On PIR and SPIR Over Gaussian MAC
by: Elimelech, Or, et al.
Published: (2024)
by: Elimelech, Or, et al.
Published: (2024)
Understanding the ratio of the partition sum to its Bethe approximation via double covers
by: Vontobel, Pascal O.
Published: (2025)
by: Vontobel, Pascal O.
Published: (2025)
Constructing rotatable permutations of $\mathbb{F}_{2^m}^3$ with $3$-homogeneous functions
by: Chi, Yunwen, et al.
Published: (2024)
by: Chi, Yunwen, et al.
Published: (2024)
Decoding Trombetti-Zhou codes: a new syndrome-based decoding approach
by: Li, Chunlei, et al.
Published: (2025)
by: Li, Chunlei, et al.
Published: (2025)
A Further Investigation on Complete Complementary Codes from $q$-ary Functions
by: Sarkar, Palash, et al.
Published: (2024)
by: Sarkar, Palash, et al.
Published: (2024)
Similar Items
-
Kruskal--Katona-Type Problems via the Entropy Method
by: Chao, Ting-Wei, et al.
Published: (2023) -
A Purely Entropic Approach to the Rainbow Triangle Problem
by: Chao, Ting-Wei, et al.
Published: (2024) -
When does a tree activate the random graph?
by: Antonir, Asaf Cohen, et al.
Published: (2025) -
On the independence number of de Bruijn graphs
by: Majer, Pietro, et al.
Published: (2026) -
Generalized graph codes and thier minimum distances
by: Fujii, Naoki
Published: (2025)