EUVIMEDEUVIMED entdecken
Crossref

Typical Structure of Hereditary Graph Families. II. Exotic Examples

Sergey Norin, Yelena Yuditsky

Random Structures & Algorithms · 2025-01 · 66 (1)

DOI: 10.1002/rsa.21272 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 26.11.2024. Verfasst von Sergey Norin und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 13 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A graph is ‐free if it does not contain an induced subgraph isomorphic to . The study of the typical structure of ‐free graphs was initiated by Erdős, Kleitman, and Rothschild (1976), who have shown that almost all ‐free graphs are bipartite. Since then the typical structure of ‐free graphs has been determined for several families of graphs , including complete graphs, trees, and cycles. Recently, Reed and Scott proposed a conjectural description of the typical structure of ‐free graphs for all graphs , which extends all previously known results in the area. We construct an infinite family of graphs for which the Reed–Scott conjecture fails, and use the methods we developed in the prequel paper Norin and Yuditsky (2024) to describe the typical structure of ‐free graphs for graphs in this family. Using similar techniques, we construct an infinite family of graphs for which the maximum size of a homogenous set in a typical ‐free graph is sublinear in the number of vertices, answering a question of Loebl et al. (2010) and Kang et al. (2014).

Zitieren

APA

Norin, S., & Yuditsky, Y. (2025). Typical Structure of Hereditary Graph Families. II. Exotic Examples. Random Structures & Algorithms, 66(1). https://doi.org/10.1002/rsa.21272

Vancouver

Norin S, Yuditsky Y. Typical Structure of Hereditary Graph Families. II. Exotic Examples. Random Structures & Algorithms. 2025;66(1). doi:10.1002/rsa.21272

BibTeX
@article{Norin2025,
  author = {Norin, Sergey and Yuditsky, Yelena},
  title = {Typical Structure of Hereditary Graph Families. II. Exotic Examples},
  journal = {Random Structures & Algorithms},
  year = {2025},
  volume = {66},
  number = {1},
  doi = {10.1002/rsa.21272}
}
Kostenlos starten →