<?xml version="1.0" encoding="UTF-8"?>
<urlset
  xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"
  xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
  xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9
                      http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd">

  <url>
    <loc>https://www.advancesincombinatorics.com/</loc>
    <changefreq>daily</changefreq>
  </url>

  <url>
    <loc>https://www.advancesincombinatorics.com/for-authors</loc>
    <changefreq>monthly</changefreq>
  </url>

  <url>
    <loc>https://www.advancesincombinatorics.com/editorial-board</loc>
    <changefreq>monthly</changefreq>
  </url>

    <url>
      <loc>https://www.advancesincombinatorics.com/pages/269-publication-ethics</loc>
      <lastmod>2021-08-31</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/pages/268-open-access-policies</loc>
      <lastmod>2022-07-29</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/pages/349-journal-statistics</loc>
      <lastmod>2026-01-13</lastmod>
    </url>

    <url>
      <loc>https://www.advancesincombinatorics.com/articles</loc>
      <changefreq>monthly</changefreq>
    </url>


    <url>
      <loc>https://www.advancesincombinatorics.com/posts</loc>
      <changefreq>monthly</changefreq>
    </url>

    <url>
      <loc>https://www.advancesincombinatorics.com/post/419-contents-list</loc>
      <lastmod>2026-02-27</lastmod>
    </url>

    <url>
      <loc>https://www.advancesincombinatorics.com/article/32563-the-number-of-partial-steiner-systems-and-d-partitions</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/57080-local-girth-choosability-of-planar-graphs</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/18614-an-aperiodic-set-of-11-wang-tiles</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/24581-the-size-ramsey-number-of-3-uniform-tight-paths</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/10810-upper-density-of-monochromatic-infinite-paths</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/35764-leaper-tours</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/13668-graphs-of-bounded-cliquewidth-are-polynomially-bounded</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/12849-the-bandwidth-theorem-in-sparse-graphs</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/10807-a-tight-erdos-posa-function-for-planar-minors</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/17912-unitary-signings-and-induced-subgraphs-of-cayley-graphs-of-mathbb-z-_2-n</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/12043-a-rainbow-version-of-mantel-s-theorem</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/12100-planar-graphs-have-bounded-nonrepetitive-chromatic-number</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/128477-bounded-twin-width-graphs-are-polynomially-bounded</loc>
      <lastmod>2025-01-21</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/24227-obstructions-for-bounded-branch-depth-in-matroids</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/83354-towards-a-hypergraph-version-of-the-posa-seymour-conjecture</loc>
      <lastmod>2023-07-20</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/156157-planar-graphs-in-blowups-of-fans</loc>
      <lastmod>2026-02-25</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/92090-the-kakeya-set-conjecture-over-z-nz-for-general-n</loc>
      <lastmod>2024-01-23</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/91335-robust-rainbow-subdivisions-and-simplicial-cycles</loc>
      <lastmod>2024-01-08</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/142501-canonical-decompositions-of-3-connected-graphs</loc>
      <lastmod>2025-09-02</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/125859-induced-subgraphs-and-tree-decompositions-xiii-basic-obstructions-in-h-free-graphs-for-finite-h</loc>
      <lastmod>2024-11-18</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/133707-11-4-colorability-of-subcubic-triangle-free-graphs</loc>
      <lastmod>2025-04-30</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/126750-decomposing-a-signed-graph-into-rooted-circuits</loc>
      <lastmod>2025-06-10</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/143720-random-reed-solomon-codes-achieve-list-decoding-capacity-with-linear-sized-alphabets</loc>
      <lastmod>2025-09-23</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/31079-exact-stability-for-turan-s-theorem</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/12047-a-completion-of-the-proof-of-the-edge-statistics-conjecture</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/35484-transversal-factors-and-spanning-trees</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/27351-improved-bounds-for-centered-colorings</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/12048-improved-bounds-for-the-erdos-rogers-function</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/18702-on-partitioning-the-edges-of-an-infinite-digraph-into-directed-cycles</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/25431-box-and-segment-intersection-graphs-with-large-girth-and-chromatic-number</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/12044-tight-paths-in-convex-geometric-hypergraphs</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/37265-extremal-functions-for-sparse-minors</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/68348-tight-ramsey-bounds-for-multiple-copies-of-a-graph</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/10256-the-structure-of-binary-matroids-with-no-induced-claw-or-fano-plane-restriction</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/38089-induced-subgraphs-and-tree-decompositions-iii-three-path-configurations-and-logarithmic-treewidth</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/18971-cycle-lengths-modulo-k-in-large-3-connected-cubic-graphs</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/38107-an-improved-procedure-for-colouring-graphs-of-bounded-local-density</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/16788-the-maximum-number-of-triangles-in-a-graph-of-given-maximum-degree</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/32357-asymptotic-enumeration-of-hypergraphs-by-degree-sequence</loc>
      <lastmod>2024-10-25</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/57310-rational-exponents-near-two</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/82157-ramsey-multiplicity-and-the-turan-coloring</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/13667-large-independent-sets-in-triangle-free-cubic-graphs-beyond-planarity</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/13691-tangles-are-decided-by-weighted-vertex-sets</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/10811-a-4-choosable-graph-that-is-not-8-2-choosable</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/24872-anticoncentration-versus-the-number-of-subset-sums</loc>
      <lastmod>2023-04-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/88916-separating-the-edges-of-a-graph-by-a-linear-number-of-paths</loc>
      <lastmod>2023-11-17</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/89090-there-are-only-a-finite-number-of-excluded-minors-for-the-class-of-bicircular-matroids</loc>
      <lastmod>2023-11-17</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/83360-ramsey-goodness-of-books-revisited</loc>
      <lastmod>2023-07-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/87619-the-sparse-parity-matrix</loc>
      <lastmod>2023-09-11</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/10808-the-ramsey-number-of-books</loc>
      <lastmod>2023-10-04</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/121414-big-ramsey-degrees-and-infinite-languages</loc>
      <lastmod>2024-08-05</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/120235-balanced-supersaturation-and-turan-numbers-in-random-graphs</loc>
      <lastmod>2024-07-16</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/123814-on-polynomial-degree-boundedness</loc>
      <lastmod>2024-09-28</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/144394-automorphism-groups-of-graphs-of-bounded-hadwiger-number</loc>
      <lastmod>2025-09-23</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/128234-convex-polytopes-in-restricted-point-sets-in-r-d</loc>
      <lastmod>2025-01-15</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/140708-a-sharp-ramsey-theorem-for-ordered-hypergraph-matchings</loc>
      <lastmod>2025-07-18</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/151284-blowups-of-triangle-free-graphs</loc>
      <lastmod>2025-12-12</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/129887-induced-subgraphs-and-tree-decompositions-ix-grid-theorem-for-perforated-graphs</loc>
      <lastmod>2025-02-28</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/article/132261-homomorphism-tensors-and-linear-equations</loc>
      <lastmod>2025-04-01</lastmod>
    </url>


    <url>
      <loc>https://www.advancesincombinatorics.com/section/1523-combinatorial-geometry</loc>
      <lastmod>2019-09-08</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/section/1522-discrete-probability</loc>
      <lastmod>2019-09-08</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/section/1517-extremal-combinatorics</loc>
      <lastmod>2019-10-22</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/section/1520-hypergraphs</loc>
      <lastmod>2019-09-08</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/section/1515-matroid-theory</loc>
      <lastmod>2019-10-21</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/section/1519-set-systems</loc>
      <lastmod>2019-09-08</lastmod>
    </url>
    <url>
      <loc>https://www.advancesincombinatorics.com/section/1581-structural-graph-theory</loc>
      <lastmod>2019-10-21</lastmod>
    </url>

</urlset>
