A polynomial Ramsey statement for bounded VC-dimension

DOI10.1016/J.EJC.2025.104303MaRDI QIDQ6872466zbMATH OpenFDO

Authors Tomáš Hons

Publication date 20 January 2026

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2025.104303

zbMATH Keywords

binary matroidcycle matroidminorRamsey functionRamsey theoryunavoidable minorsvector matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Ramsey theory (05D10) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)

Cites work

• A combinatorial problem; stability and order for models and theories in infinitary languages
• A course in model theory
• A Guide to NIP Theories
• Bounded VC-dimension implies the Schur-Erdős conjecture
• Decomposition horizons and a characterization of stable hereditary classes of graphs
• Distal combinatorial tools for graphs of bounded twin-width
• First-Order Model Checking on Structurally Sparse Graph Classes
• Flip-width: cops and robber on dense graphs
• Flipper games for monadically stable graph classes
• scientific article; zbMATH DE number 3628985 (Why is no real title available?)
• scientific article; zbMATH DE number 1099508 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• Indiscernibles and flatness in monadically stable and monadically NIP classes
• List-compactness of infinite directed graphs
• Neighbourhood complexity of graphs of bounded twin-width
• On a problem of formal logic.
• On the density of families of sets
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On the Zarankiewicz problem for graphs with bounded VC-dimension
• On unavoidable-induced subgraphs in large prime graphs
• Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets
• Regularity lemmas for stable graphs
• Some remarks on the theory of graphs
• The Erdős-Hajnal conjecture. A survey
• Twin-width and polynomial kernels
• Twin-width. I: Tractable FO model checking
• Twin-width. III: Max independent set, min dominating set, and coloring
• Twin-width. IV: Ordered graphs and matrices
• Unavoidable minors of large 3-connected binary matroids

This page was built for publication: A polynomial Ramsey statement for bounded VC-dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6872466)