Inicio
Explorar
nav.journalClub
Tendencias
Más
synapse
⌘+K
Idioma
Español
Español
On Turán problems with bounded fractional matching number | Synapse
March 3, 2026
On Turán problems with bounded fractional matching number
LZ
Lin-Peng Zhang
HB
Hajo Broersma
LW
Ligong Wang
Puntos clave
Findings present new bounds on the fractional matching number in Turán problems, enhancing existing theories.
The metric indicates a significant relationship between bounded fractional matching number and Turán problems.
Analysis of graph theory using combinatorial optimization methods demonstrates improved understanding of matching.
Results suggest optimized strategies for achieving better matching in bounded frameworks, highlighting the importance of fractional numbers.
Mark Helpful
Me gusta
Save
Guardar
Relay
Compartir
Mark Helpful
Me gusta
Save
Guardar
Relay
Compartir
Cite This Study
Copy
Zhang et al. (Tue,) studied this question.
synapsesocial.com/papers/69a760a7c6e9836116a2d9af
https://doi.org/https://doi.org/10.1016/j.disc.2026.115026