On the number of types in sparse graphs-Reference-Cited by-同舟云学术

On the number of types in sparse graphs

Published:2018-07-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Pilipczuk Michał¹,Siebertz Sebastian¹,Toruńczyk Szymon¹

Affiliation:

1. Institute of Informatics, University of Warsaw, Poland

Funder

H2020 Marie SkBodowska-Curie Actions

Narodowe Centrum Nauki

Fundacja na rzecz Nauki Polskiej

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3209108.3209178

Reference41 articles.

1. Interpreting nowhere dense graph classes as a classical notion of model theory

2. Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem

3. Noga Alon Michael Krivelevich and Benny Sudakov. 2003. Turán numbers of bipartite graphs and related Ramsey-type questions. Comb. Probab. Comput. 12 5+ 6 (2003) 477--494. 10.1017/S0963548303005741 Noga Alon Michael Krivelevich and Benny Sudakov. 2003. Turán numbers of bipartite graphs and related Ramsey-type questions. Comb. Probab. Comput. 12 5+ 6 (2003) 477--494. 10.1017/S0963548303005741

4. Vapnik-Chervonenkis density in some theories without the independence property, I

5. On preservation under homomorphisms and unions of conjunctive queries

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles;Lecture Notes in Computer Science;2024

3. Flip-width: Cops and Robber on dense graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes;Logical Methods in Computer Science;2023-06-06

5. Bounds on Half Graph Orders in Powers of Sparse Graphs;The Electronic Journal of Combinatorics;2023-04-07