EUVIMEDEUVIMED entdecken
Crossref

A lower bound on the number of edges in DP-critical graphs

Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka, Jingwei Xu

Journal of Combinatorial Theory, Series B · 2026-07 · 179 · 118-146

DOI: 10.1016/j.jctb.2026.03.002 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Combinatorial Theory, Series B, 2026-07. Verfasst von Peter Bradshaw und 3 weiteren Autor:innen. Die Arbeit nennt 33 Literaturangaben. Gefördert von: Hankuk University of Foreign Studies, Ministry of Science and ICT, South Korea, Institute for Basic Science.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Hankuk University of Foreign Studies
  • Ministry of Science and ICT, South Korea
  • Institute for Basic Science
  • National Science Foundation Division of Mathematical Sciences
  • Campus Research Board
  • University of Illinois Urbana-Champaign The Graduate College
  • University of Illinois at Urbana-Champaign
  • National Research Foundation of Korea

Zitieren

APA

Bradshaw, P., Choi, I., Kostochka, A., & Xu, J. (2026). A lower bound on the number of edges in DP-critical graphs. Journal of Combinatorial Theory, Series B, 179, 118-146. https://doi.org/10.1016/j.jctb.2026.03.002

Vancouver

Bradshaw P, Choi I, Kostochka A, Xu J. A lower bound on the number of edges in DP-critical graphs. Journal of Combinatorial Theory, Series B. 2026;179:118-146. doi:10.1016/j.jctb.2026.03.002

BibTeX
@article{Bradshaw2026,
  author = {Bradshaw, Peter and Choi, Ilkyoo and Kostochka, Alexandr and Xu, Jingwei},
  title = {A lower bound on the number of edges in DP-critical graphs},
  journal = {Journal of Combinatorial Theory, Series B},
  year = {2026},
  volume = {179},
  pages = {118--146},
  doi = {10.1016/j.jctb.2026.03.002}
}
Kostenlos starten →