2-Trees as Subgraphs of Rectangle Intersection Graphs

A rectangle intersection graph is a graph whose vertices are rectangles in which two rectangles are adjacent if and only if they intersect. A 2-tree is any graph that can be obtained by starting with a single edge and repeatedly adding a vertex adjacent to both endpoints of an existing edge. In this talk I will prove that, for every natural number $k$, there exists a 2-tree $T_k$ such that any rectangle intersection graph that contains a subgraph isomorphic to $T_k$ also contains a clique of size $k$. I will also give some background and motivation for studying these kinds of problems.

This is joint work with Vida Dujmović, Gwenaël Joret, and David Wood.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.6066699028015137, "perplexity": 181.00333753512285}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-26/segments/1529267866937.79/warc/CC-MAIN-20180624121927-20180624141927-00409.warc.gz"}