cs.DM · 2026-10-14 · No. 143

Discrete Mathematics, 2026-10-14.

1 new papers in cs.DM. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

    On Collusion-Free Teaching in Planar Graphs

    Khazaliya Liana, Kuske Clemens

    cs.DM · cs.CC · cs.LG

    Non-clashing teaching minimizes teaching complexity among models satisfying the Goldman--Mathias collusion-avoidance criterion. While the Vapnik--Chervonenkis dimension (VCdim) measures the complexity of learning from samples, non-clashing teaching dimension (NCTD) measures the number of examples required when a teacher can select them. Whether NCTD is always bounded above by VCdim remains a fundamental open question in learning theory. In...

    arxiv.org/abs/2610.18714 · PDF

This edition is part of The Daily Abstract — cs.DM archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.