Pith. sign in

REVIEW 2 major objections 5 minor 71 references

Recent advances in arrow relations and traces of sets

T0 review · 2 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This survey assembles recent progress on arrow relations — the extremal framework that quantifies when large set families force rich traces — into a single map of exact bounds, methods, and open problems.

desk verdict A well-organized survey of recent arrow-relation results, with a few genuine citation and typesetting errors but no fatal flaws; the stress-test "inconsistency" in Theorem 3's proof turns out to be a misreading. read the letter →

arxiv 2507.23375 v1 pith:2S4NCRGQ submitted 2025-07-31 math.CO

Mingze Li , Jie Ma , Mingyuan Rong This is my paper · ORCID
classification math.CO MSC 05D0505C3505C65
keywords arrowrelationtracesofsetsextremalsettheorySauer–ShelahlemmaVCdimensiontracefunctionhereditaryfamiliesTuránnumbersfor
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This survey assembles the recent literature on arrow relations, the extremal-set-theory framework that asks how large a family $\mathcal{F} \subseteq 2^{[n]}$ must be before some $a$-element subset $T$ leaves a trace $\mathcal{F}|_T$ of at least $b$ distinct sets, written $(n,m) \to (a,b)$. Its aim is to give researchers a single coherent map of the field: exact values and asymptotic thresholds where they are known, the methods that produce them, and the questions still open. The paper argues that this one relation ties together the Sauer–Shelah lemma, defect-Sauer values $m(n,a,b)$, single-element removal problems, trace functions, shattering-extremal families, forbidden matrix configurations, and Turán-type results for hypergraph traces, and that recent work has filled in precise answers across several fronts. A reader who wants the current state of any of these problems can find the sharpest known bound and its proof strategy in one place, along with a short list of open conjectures.

What carries the argument

The load-bearing mechanism is Frankl's reduction: Lemma 1 of the paper proves that $(n,m) \to (a,b)$ holds for all families if and only if it holds for every hereditary family of size exactly $m$. The proof works through the squash operation $S_v(\mathcal{F})$, which removes a vertex $v$ from a set when the smaller set is not already present; Proposition 2 shows squashing never increases any trace size, so any counterexample with minimum total size must be hereditary. This turns trace problems into minimum-degree and weight problems on hereditary families. Around this core the survey relies on several further devices: the Kruskal–Katona theorem and Katona's weighted version, which drive the single-element-removal lower bounds; the Sparse Kruskal–Katona theorem, which yields the trace-function exponent $\mu(r,\alpha)$; the dual inequalities $|str(\mathcal{F})| \le |\mathcal{F}| \le |tr(\mathcal{F})|$ and the order-shattering machinery, which characterize $s$-extremal families; and the incidence-matrix and induced-Berge-copy dictionaries that convert trace avoidance into forbidden configurations and Turán-type problems. Each of these tools is stated with enough precision that a reader can apply it directly.

What would settle it

Spot-check the survey against its sources: verify that reference [18], credited in the introduction with introducing the arrow relation, actually contains that definition (Section 4's attribution suggests a mismatch), and verify the numerical entries $m(6,4,12) = 24$, $m(11) = 53/10$, and $m(12) = 28/5$ against [17], [49], and [59]; the first confirmed mismatch would directly falsify the survey's accuracy claim.

Watch

Extended reading notes

Core claim

The central claim is organizational and the paper states it directly: the arrow relation $(n,m) \to (a,b)$ is a working quantitative language for trace problems, and the results surveyed here show that the language now carries exact answers in several regimes. Concretely, the survey covers: Frankl's reduction ([27], Lemma 1) showing arrow relations need only be verified on hereditary families, via squash operations that never increase any trace; the defect-Sauer values for $a \le 4$, including $m(n,3,7) = \lfloor n^2/4 \rfloor + n + 2$ and $m(n,4,13)$ for $n \ge 25$, with the three unresolved cells tied to classical Turán problems; the single-element removal function $m(n,s)$ and its limit $m(s)$, now determined for all $s \le 16$ with $m(11) = 53/10$ and the full range $m(2^{d-1}-c) = (2^d-c)/d$ for $1 \le c \le d-1$; trace-function thresholds given by the Sparse Kruskal–Katona theorem, $\mathrm{Tr}(n,n^r,\alpha n) = n^{\mu(1-o(1))}$; the structure and enumeration of families with $|tr(\mathcal{F})| = |\mathcal{F}|$; forbidden-configuration bounds in simple matrices; and the reduction of Turán numbers for induced traces, $\mathrm{ex}(n, \mathrm{Tr}_r(F)) = \Theta(\max_{2 \le s \le r} \mathrm{ex}(n,K_s,F))$. Treated together, these lines of work form a single field with shared tools — squashing, Kruskal–Katona-type weight inequalities, and the trace/shattering duality — and the survey's open problems section names the exact next targets.

Load-bearing premise

The survey's worth rests on the fidelity of its reporting: every theorem, value, and attribution must match the source it cites, and that premise is already strained by an internal slip, since the introduction credits 'Hajnal' with introducing the arrow relation while reference [18] is the 1972 Bondy paper that Section 4 later credits with the same result, so the reader cannot assume every citation was checked against its source.

Editorial extensions

If this is right

  • The tables of Section 3 settle the minimum family size forcing a trace of size $b$ on $a$ elements for all $a \le 4$, leaving exactly three cells ($m(n,4,9)$, $m(n,4,14)$, $m(n,4,15)$) whose values are governed by longstanding Turán problems, so progress on those extremal problems would automatically fill the remaining cells.
  • All values of $m(s)$ for $s \le 16$ are now known, including $m(11) = 53/10$ confirming a 1994 conjecture of Watanabe and Frankl, and the formula $m(2^{d-1}-c) = (2^d-c)/d$ for $1 \le c \le d-1$ completes the picture for loss rates just below powers of two; what remains is $s$ far from powers of two or slightly above them.
  • The trace function is determined up to logarithmic factors: $\mathrm{Tr}(n,n^r,\alpha n) = n^{\mu(1-o(1))}$ for constant $r, \alpha$, with $\mathrm{Tr}(n,n^2,n/2) = \tilde{\Theta}(n^{1.7067...})$ closing the long gap between the old polynomial lower bound and $o(n^2)$ upper bound.
  • The reverse Sauer inequality and the chunk criteria give a structural handle on shattering-extremal families, and the enumeration $f(n,k) = n^{(1+o(1))\binom{n}{k}}$ shows their number is understood asymptotically; the open Conjecture 4 asks whether every such family can be shrunk by one set while remaining extremal.
  • Turán numbers for induced traces reduce to generalized Turán numbers via $\mathrm{ex}(n, \mathrm{Tr}_r(F)) = \Theta(\max_{2\le s \le r} \mathrm{ex}(n, K_s, F))$, so trace-avoidance problems inherit the full extremal-graph toolkit, and the Mubayi–Zhao Conjecture 5 gives a concrete target for the exact values.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because Proposition 2 guarantees that squashing never increases trace size, any exhaustive search for the remaining open cells, such as $m(n,4,9)$, can be restricted to hereditary families; a computational campaign for moderate $n$ would produce data that simultaneously constrains $\mathrm{ex}(n,\{C_3^+, C_4\})$, since Table 1 binds the two quantities together.
  • The known exact values of $m(s)$ cluster at loss rates $s$ just below powers of two, which suggests a structural transition in the optimal families as $s$ approaches or exceeds a power of two; testing where the extremal constructions change shape would extend the map beyond the boundaries the survey draws.
  • The dictionaries of Sections 7 and 8 point to a transfer principle that could run in the opposite direction as well: new constructions for hypergraph Turán densities can be converted into trace-avoiding set families through incidence matrices, potentially feeding back into the three open cells of Table 1.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. The paper is a survey of arrow relations and traces of finite sets. It organizes the literature into defect Sauer results, single-element removal, trace functions, extremal families, forbidden configurations in matrices, and Turán numbers for traces, and it closes with open problems. The survey introduces no new theorems; its contribution is a unified presentation of known results, including reproduced proofs of Frankl's hereditary-family lemma (Lemma 1), the determination of m(n,3,7) (Theorem 3), and Frankl's lower bound for m(n,2^{d-1}-1) (Theorem 8), together with tables of known values and a substantial bibliography.

Significance. If the survey is accurate, it provides a useful map of a scattered literature and a convenient entry point for researchers. The reproduced proofs I checked are logically coherent, and the tables of exact values and asymptotic results are valuable reference material. The paper's value is therefore heavily dependent on the fidelity of its attributions and displayed formulas. I also checked the suspected inconsistency in the proof of Theorem 3: the chain 2+n+floor(n^2/4)=|F|≤1+n+ex(n,K3)=1+n+floor(n^2/4) is a valid contradiction, and the lower-bound construction has size floor(n^2/4)+n+1, exactly one less than the claimed extremal value, which is the intended tightness. No correction to Theorem 3 is needed.

major comments (2)
  1. [§1 and §4] There are clear attribution mismatches that undermine the survey's reference value. The introduction states that 'Hajnal [18] introduced the arrow relation', but reference [18] is Bondy (1972), and Section 4 correctly attributes the relevant result to Bondy. Similarly, Theorem 7 is labeled 'Bollobás [50]' and the introduction credits 'Bollobás [50]' with studying the single-element-removal problem, yet reference [50] is Lovász's book. These are not isolated typos: the authors should verify every name-reference pair in the manuscript.
  2. [§5, Theorem 21 and surrounding text; also §8, Theorem 43] Several displayed formulas have lost their superscripts and are formally wrong as printed. For example, Theorem 21 states 'Tr(n,nr,αn)≥(1−o(1))nλr' instead of 'Tr(n,n^r,αn)≥(1−o(1))n^{λr}', and the preceding paragraph writes 'n α r' where 'n^{α r}' is meant. Theorem 43 in Section 8 similarly has missing exponents, e.g., '(n/(s−1))^{s−1}+o(n^{s−1})' is not what is printed. Because a reader cannot verify the statements in this form, a systematic correction of all mathematical displays is required.
minor comments (5)
  1. [§6, order-shattering definition] The definition of order-shattering appears garbled: the condition 'T′∩C=T′∩D' for all C∈F0 and D∈F1 cannot hold for 2^{|T|} sets unless T′ is empty. Please check the statement against Anstee, Rónyai, and Sali [12] and clarify the quantifiers.
  2. [§3, proof of Theorem 3] The proof would benefit from explicitly stating that the argument assumes n≥3 and that the hereditary family F contains a 2-set, so that ∅ and all n singletons are indeed members of F; the current text leaves these edge cases implicit.
  3. [§4, Construction 10] The notation 'F={F⊆[n] : F∈2^{U_i}\setminus G_i for some i∈[k]}' should make explicit that the empty set is counted once despite lying in every 2^{U_i}; otherwise the displayed size formula is not immediate.
  4. [§2] There are minor typos: 'trival' should be 'trivial' and 'propositon' should be 'proposition'.
  5. [§3, Table 1] The note that 'all values in this table are precisely established' is too strong: the b=13 row is only for n≥25, and the b=12 row has a separate n=6 exception. These restrictions should be stated in the note.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the survey reports external results, and its few self-citations are descriptive rather than load-bearing.

full rationale

This is a survey paper with no new theorems or fitted parameters; its claimed role is to report and organize known results. The derivations it does contain are standard and self-contained in the expository sense: Lemma 1 is proved from the squashing operation and Proposition 2; the proof of Theorem 3 uses only Lemma 1 together with Mantel's theorem; and the proof of Theorem 8 uses the stated Kruskal-Katona type theorem. None of these steps defines its conclusion into its assumptions. The authors' own results [49] are presented descriptively in Theorems 17 and 18 and are not used to justify any other claim in the survey, so the self-citation is not load-bearing. The introduction has an attribution inconsistency, crediting the arrow relation to 'Hajnal [18]' whereas reference [18] is Bondy and Section 4 correctly attributes the result to Bondy; this is a correctness issue, not circularity. The displayed chain in the proof of Theorem 3 is typographically awkward, but the intended contradiction is arithmetically valid. Because the survey's content is imported from independent sources and no prediction is derived from fitted inputs, the circularity score is 0.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The paper is a survey and introduces no free parameters or invented entities. Its reproduced proofs rely on standard extremal set theory (Sauer-Shelah, Mantel, Katona). The survey's central value depends on the accurate transcription of external theorems, an assumption that shows a crack in the Hajnal/Bondy misattribution.

assumptions (4)
  • standard math Sauer-Shelah lemma (Theorem 1)
    Foundation of arrow relations; quoted but not proved, used to express the b=2^a case.
  • standard math Mantel's theorem: ex(n,K3)=floor(n^2/4)
    Used in the proof of Theorem 3 to bound the number of 2-element sets in a K3-free hereditary family.
  • standard math Katona's weight theorem (Theorem 9)
    Used in the proof of Theorem 8 to lower-bound sum of 1/(|H|+1) over links; cited to [43].
  • domain assumption Correctness of external cited results
    The survey's stated theorems are taken from primary sources without proof; any transcription error undermines the survey's reliability.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Recent advances in arrow relations and traces of sets." pith.science (2026). https://pith.science/paper/2S4NCRGQ

@misc{pith2026250723375,
  author       = {Pith},
  title        = {Pith review of: Recent advances in arrow relations and traces of sets},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2S4NCRGQ}},
  note         = {Machine review of arXiv:2507.23375}
}
abstract

The arrow relation, a central concept in extremal set theory, captures quantitative relationships between families of sets and their traces. Formally, the arrow relation $(n, m) \rightarrow (a, b)$ signifies that for any family $\mathcal{F} \subseteq 2^{[n]}$ with $|\mathcal{F}| \geqslant m$, there exists an $a$-element subset $T \subseteq [n]$ such that the trace $\mathcal{F}_{|T} = \{ F \cap T : F \in \mathcal{F} \}$ contains at least $b$ distinct sets. This survey highlights recent progress on a variety of problems and results connected to arrow relations. We explore diverse topics, broadly categorized by different extremal perspectives on these relations, offering a cohesive overview of the field.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

71 extracted references · 70 canonical work pages

  1. [18]

    Journal of Combinatorial Theory, Series B 12(2), 201–202 (1972)

    Bondy, J.: Induced subsets. Journal of Combinatorial Theory, Series B 12(2), 201–202 (1972)

    work page 1972

  2. [50]

    Lov ´asz, L.: Combinatorial Problems and Exercises, vol. 361. American Mathematical Soc. (2007)

    work page 2007

  3. [1]

    Discrete Mathematics 137(1-3), 345–349 (1995)

    Aldred, R.E., Anstee, R.P.: On the density of sets of divisors. Discrete Mathematics 137(1-3), 345–349 (1995)

    work page 1995

  4. [2]

    Discrete Mathematics 46(2), 199–202 (1983)

    Alon, N.: On the density of sets of vectors. Discrete Mathematics 46(2), 199–202 (1983)

    work page 1983

  5. [3]

    Sbornik: Mathematics 208(12), 1724–1757 (2017)

    Alon, N., Moran, S., Yehudayoff, A.: Sign rank versus Vapnik-Chervonenkis dimension. Sbornik: Mathematics 208(12), 1724–1757 (2017)

    work page 2017

  6. [4]

    Journal of the London Mathematical Society 100(2), 498–517 (2019)

    Alon, N., Moshkovitz, G., Solomon, N.: Traces of hypergraphs. Journal of the London Mathematical Society 100(2), 498–517 (2019)

    work page 2019

  7. [5]

    Journal of Combinatorial Theory, Series B 121, 146–172 (2016)

    Alon, N., Shikhelman, C.: Many 𝑇 copies in𝐻-free graphs. Journal of Combinatorial Theory, Series B 121, 146–172 (2016)

    work page 2016

  8. [6]

    Journal of Combinatorial Theory, Series A 47(1), 16–27 (1988)

    Anstee, R.P.: A forbidden configuration theorem of Alon. Journal of Combinatorial Theory, Series A 47(1), 16–27 (1988)

    work page 1988

Show all 71 references
  1. [7]

    The Electronic Journal of Combinatorics 1000 (2013)

    Anstee, R.P.: A Survey of Forbidden Configuration Results. The Electronic Journal of Combinatorics 1000 (2013)

    2013

  2. [8]

    Discrete Mathematics62(3), 225–243 (1986)

    Anstee, R.P., F¨ uredi, Z.: Forbidden submatrices. Discrete Mathematics62(3), 225–243 (1986)

    1986

  3. [9]

    The Electronic Journal of Combinatorics 17(1) (2010)

    Anstee, R.P., Karp, S.N.: Forbidden Configurations: Exact Bounds Determined by Critical Substructures. The Electronic Journal of Combinatorics 17(1) (2010)

    2010

  4. [10]

    Discrete Mathematics 311(20), 2187–2197 (2011) 18 Mingze Li, Jie Ma, and Mingyuan Rong

    Anstee, R.P., Meehan, C.: Forbidden configurations and repeated induction. Discrete Mathematics 311(20), 2187–2197 (2011) 18 Mingze Li, Jie Ma, and Mingyuan Rong

    2011

  5. [11]

    The Electronic Journal of Combinatorics29(2) (2022)

    Anstee, R.P., Nikov, N.A.: Shattering and More: Extending the Complete Object. The Electronic Journal of Combinatorics29(2) (2022)

    2022

  6. [12]

    Graphs and Combinatorics 18(1), 59–73 (2002)

    Anstee, R.P., R ´onyai, L., Sali, A.: Shattering news. Graphs and Combinatorics 18(1), 59–73 (2002)

    2002

  7. [13]

    Discrete Mathematics 175(1-3), 13–21 (1997)

    Anstee, R.P., Sali, A.: Sperner families of bounded VC-dimension. Discrete Mathematics 175(1-3), 13–21 (1997)

    1997

  8. [14]

    Discrete Applied Mathematics247, 322–326 (2018)

    Balogh, J., M ´esz´aros, T., Wagner, A.Z.: Two results about the hypercube. Discrete Applied Mathematics247, 322–326 (2018)

    2018

  9. [15]

    Gauthier-Villars, Paris (1987)

    Berge, C.: Hypergraphes: Combinatoire Des Ensembles Finis. Gauthier-Villars, Paris (1987)

    1987

  10. [16]

    Proceedings of the London Mathematical Society s3-58(1), 153–168 (1989)

    Bollob ´as, B., Leader, I., Radcliffe, A.J.: Reverse Kleitman Inequalities. Proceedings of the London Mathematical Society s3-58(1), 153–168 (1989)

    1989

  11. [17]

    Journal of Combinatorial Theory, Series A 72(2), 189–208 (1995)

    Bollob ´as, B., Radcliffe, A.: Defect Sauer results. Journal of Combinatorial Theory, Series A 72(2), 189–208 (1995)

    1995

  12. [19]

    In: Studies in Pure Mathematics, pp

    Brown, W.G.: On an open problem of Paul Tur´an concerning 3-graphs. In: Studies in Pure Mathematics, pp. 91–93. Birkh¨auser Basel, Basel (1983)

    1983

  13. [20]

    Journal of Combinatorial Theory, Series A 87(2), 381–389 (1999)

    Chung, F., Lu, L.: An upper bound for the Tur ´an number𝑡3(𝑛, 4). Journal of Combinatorial Theory, Series A 87(2), 381–389 (1999)

    1999

  14. [21]

    Annales Universitatis Scientiarum Budapesti- nensis de Rolando E¨otv¨os Nominatae

    Dam ´asdi, G., H´eger, T., Sz˝onyi, T.: The Zarankiewicz problem, cages and geometries. Annales Universitatis Scientiarum Budapesti- nensis de Rolando E¨otv¨os Nominatae. Sectio mathematica. E¨otv¨os Lor´and Tudom´anyegyetem LVI, 3–37 (2013)

    2013

  15. [22]

    Extremal problems for finite sets 3, 187–197 (1991)

    de Caen, D.: The current status of Tur ´an’s problem on hypergraphs. Extremal problems for finite sets 3, 187–197 (1991)

    1991

  16. [23]

    In: Proceedings of the Berkeley Conference in Honor of Jerzy Neyman, vol

    Dudley, R.M.: The structure of some Vapnik-Chervonenkis classes. In: Proceedings of the Berkeley Conference in Honor of Jerzy Neyman, vol. 2, pp. 495–507 (1985)

    1985

  17. [24]

    Magyar Tudom ´anyos Akad´emia Matematikai Kutat ´o Int´ezet´enek K¨ozlem´enyei 7, 459–464 (1962)

    Erd ˝os, P.: On the number of complete subgraphs contained in certain graphs. Magyar Tudom ´anyos Akad´emia Matematikai Kutat ´o Int´ezet´enek K¨ozlem´enyei 7, 459–464 (1962)

    1962

  18. [25]

    Combinatorics, Probability and Computing 22(1), 21–54 (2013)

    Falgas-Ravry, V., Vaughan, E.R.: Applications of the Semi-Definite Method to the Tur´an Density Problem for 3-Graphs. Combinatorics, Probability and Computing 22(1), 21–54 (2013)

    2013

  19. [26]

    Matematicheskie Zametki 44(4), 546–550 (1988)

    Fon-Der-Flaas, D.G.: Method for construction of (3, 4)-graphs. Matematicheskie Zametki 44(4), 546–550 (1988)

    1988

  20. [27]

    Journal of Combinatorial Theory, Series A 34(1), 41–45 (1983)

    Frankl, P.: On the trace of finite sets. Journal of Combinatorial Theory, Series A 34(1), 41–45 (1983)

    1983

  21. [28]

    Graphs and Combinatorics 5(1), 295–299 (1989)

    Frankl, P.: Traces of antichains. Graphs and Combinatorics 5(1), 295–299 (1989)

    1989

  22. [29]

    Discrete Mathematics50, 323–328 (1984)

    Frankl, P., F¨ uredi, Z.: An exact result for 3-graphs. Discrete Mathematics50, 323–328 (1984)

    1984

  23. [30]

    Frankl, P., Tokushige, N.: Extremal Problems for Finite Sets, vol. 86. American Mathematical Soc. (2018)

    2018

  24. [31]

    Graphs and Combinatorics 40(1) (2024)

    Frankl, P., Wang, J.: Four-vertex traces of finite sets. Graphs and Combinatorics 40(1) (2024)

    2024

  25. [32]

    European Journal of Combinatorics 111, 103692 (2023)

    F¨ uredi, Z., Luo, R.: Induced Tur´an problems and traces of hypergraphs. European Journal of Combinatorics 111, 103692 (2023)

    2023

  26. [33]

    Extremal problems for finite sets3, 255–282 (1991)

    F¨ uredi, Z., Pach, J.: Traces of finite sets: Extremal problems and geometric applications. Extremal problems for finite sets3, 255–282 (1991)

    1991

  27. [34]

    Ars Combin18, 195–200 (1984)

    F¨ uredi, Z., Quinn, F.: Traces of finite sets. Ars Combin18, 195–200 (1984)

    1984

  28. [35]

    In: Bolyai Society Mathematical Studies, pp

    F¨ uredi, Z., Simonovits, M.: The History of Degenerate (Bipartite) Extremal Graph Problems. In: Bolyai Society Mathematical Studies, pp. 169–264. Springer Berlin Heidelberg, Berlin, Heidelberg (2013)

    2013

  29. [36]

    arXiv preprint arXiv:2310.05601 (2023)

    Gerbner, D.: On forbidding graphs as traces of hypergraphs. arXiv preprint arXiv:2310.05601 (2023)

    2023 arXiv

  30. [37]

    SIAM Journal on Discrete Mathematics 31(4), 2314–2327 (2017)

    Gerbner, D., Palmer, C.: Extremal Results for Berge Hypergraphs. SIAM Journal on Discrete Mathematics 31(4), 2314–2327 (2017)

    2017

  31. [38]

    Chapman and Hall/CRC (2018)

    Gerbner, D., Patk ´os, B.: Extremal Finite Set Theory, 1 edn. Chapman and Hall/CRC (2018)

    2018

  32. [39]

    Studia Sci

    Gronau, H.O.F.: An extremal set problem. Studia Sci. Math. Hungar 15, 29–30 (1980)

    1980

  33. [40]

    CSIAM Transactions on Applied Mathematics 4(1), 74–128 (2023)

    He, J., Ma, J., Yang, T.: Some exact results on 4-cycles: stability and supersaturation. CSIAM Transactions on Applied Mathematics 4(1), 74–128 (2023)

    2023

  34. [41]

    In: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp

    Kahn, J., Kalai, G., Linial, N.: The influence of variables on Boolean functions. In: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp. 68–80. IEEE, White Plains, NY, USA (1988)

    1988

  35. [42]

    In: Theory of Graphs, Proceedings of the Colloquium Held at Tihany, Hungary, pp

    Katona, G.O.H.: A theorem on finite sets. In: Theory of Graphs, Proceedings of the Colloquium Held at Tihany, Hungary, pp. 187–207. Academic Press (1968)

    1968

  36. [43]

    In: Probl `emes Combinatoires et Th´eorie Des Graphes, pp

    Katona, G.O.H.: Optimization for order ideals under a weight assignment. In: Probl `emes Combinatoires et Th´eorie Des Graphes, pp. 257–258 (1978)

    1978

  37. [44]

    Combinatorica 2(2), 187–192 (1982)

    Kostochka, A.V.: A class of constructions for Tur´an’s(3, 4)-problem. Combinatorica 2(2), 187–192 (1982)

    1982

  38. [45]

    Zarankiewicz

    K ˝ov´ari, T., S´os, V., Tur´an, P.: On a problem of K. Zarankiewicz. Colloquium Mathematicum 3(1), 50–57 (1954)

    1954

  39. [46]

    The Electronic Journal of Combinatorics 20(3) (2013)

    Kozma, L., Moran, S.: Shattering, Graph Orientations, and Connectivity. The Electronic Journal of Combinatorics 20(3) (2013)

    2013

  40. [47]

    Mathematical optimization techniques 10, 251–278 (1963)

    Kruskal, J.B.: The number of simplices in a complex. Mathematical optimization techniques 10, 251–278 (1963)

    1963

  41. [48]

    Discrete Applied Mathematics 276, 92–101 (2020)

    Kusch, C., M ´esz´aros, T.: Shattering-extremal set systems from Sperner families. Discrete Applied Mathematics 276, 92–101 (2020)

    2020

  42. [49]

    arXiv preprint arXiv:2406.18870 (2024)

    Li, M., Ma, J., Rong, M.: Exact results on traces of sets. arXiv preprint arXiv:2406.18870 (2024)

    2024 arXiv

  43. [51]

    The Electronic Journal of Combinatorics 28(2), P2.4 (2021)

    Luo, R., Spiro, S.: Forbidding 𝐾2,𝑡 traces in triple systems. The Electronic Journal of Combinatorics 28(2), P2.4 (2021)

    2021

  44. [52]

    Bulletin of the London Mathematical Society55(4), 1655–1667 (2023)

    Ma, J., Yang, T.: Upper bounds on the extremal number of the 4-cycle. Bulletin of the London Mathematical Society55(4), 1655–1667 (2023)

    2023

  45. [53]

    ISRN Combinatorics 2013, 1–8 (2013)

    M ´esz´aros, T., R´onyai, L.: Shattering-Extremal Set Systems of Small VC-Dimension. ISRN Combinatorics 2013, 1–8 (2013)

    2013

  46. [54]

    The Electronic Journal of Combinatorics21(4) (2014)

    M ´esz´aros, T., R´onyai, L.: Shattering-Extremal Set Systems of VC Dimension at most 2. The Electronic Journal of Combinatorics21(4) (2014)

    2014

  47. [55]

    Graphs and Combinatorics 23(6), 667–679 (2007)

    Mubayi, D., Zhao, Y.: Forbidding Complete Hypergraphs as Traces. Graphs and Combinatorics 23(6), 667–679 (2007)

    2007

  48. [56]

    Combinatorics, Probability and Computing 14(5-6), 845–849 (2005)

    Naor, A., Verstra ¨ete, J.: A Note on Bipartite Graphs Without 2k-Cycles. Combinatorics, Probability and Computing 14(5-6), 845–849 (2005)

    2005

  49. [57]

    Editions Hermann (1985)

    Pajor, A.: Sous Espaces Ln1 Des Espaces de Banach. Editions Hermann (1985)

    1985

  50. [58]

    Pacific Journal of Mathematics 41(1), 247–261 (1972)

    Perles, M.A., Shelah, S.: A combinatorial problem; stability and order for models and theories in infinitary languages. Pacific Journal of Mathematics 41(1), 247–261 (1972)

    1972

  51. [59]

    Journal of Combinatorial Theory, Series A 182, 105447 (2021) References 19

    Piga, S., Sch¨ ulke, B.: On extremal problems concerning the traces of sets. Journal of Combinatorial Theory, Series A 182, 105447 (2021) References 19

    2021

  52. [60]

    arXiv preprint arXiv:2206.05884 (2022)

    Qian, B., Ge, G.: A note on the Tur ´an number for the traces of hypergraphs. arXiv preprint arXiv:2206.05884 (2022)

    2022 arXiv

  53. [61]

    Raggi, M.: Forbidden configurations. Ph.D. thesis, University of British Columbia, Vancouver, BC, Canada (2011)

    2011

  54. [62]

    SIAM Journal on Discrete Mathematics 24(3), 946–963 (2010)

    Razborov, A.A.: On 3-Hypergraphs with Forbidden 4-Vertex Configurations. SIAM Journal on Discrete Mathematics 24(3), 946–963 (2010)

    2010

  55. [63]

    arXiv preprint arXiv:2501.01294 (2025)

    Reiher, C., Sch¨ ulke, B.: Minimum degree in simplicial complexes. arXiv preprint arXiv:2501.01294 (2025)

    2025 arXiv

  56. [64]

    The Electronic Journal of Combinatorics24(2) (2017)

    Sali, A., Spiro, S.: Forbidden Families of Minimal Quadratic and Cubic Configurations. The Electronic Journal of Combinatorics24(2) (2017)

    2017

  57. [65]

    Journal of Combinatorial Theory, Series A 13(1), 145–147 (1972)

    Sauer, N.: On the density of families of sets. Journal of Combinatorial Theory, Series A 13(1), 145–147 (1972)

    1972

  58. [66]

    Tur ´an, P.: On an external problem in graph theory. Mat. Fiz. Lapok 48, 436–452 (1941)

    1941

  59. [67]

    In: Doklady Akademii Nauk USSR, vol

    Vapnik, V.N.: On the uniform convergence of relative frequencies of events to their probabilities. In: Doklady Akademii Nauk USSR, vol. 181, pp. 781–787 (1968)

    1968

  60. [68]

    In: Measures of Complexity, pp

    Vapnik, V.N., Chervonenkis, A.Ya.: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities. In: Measures of Complexity, pp. 11–30. Springer International Publishing, Cham (2015)

    2015

  61. [69]

    Discrete Mathematics 94(1), 53–64 (1991)

    Watanabe, M.: Arrow relations on families of finite sets. Discrete Mathematics 94(1), 53–64 (1991)

    1991

  62. [70]

    Graphs and Combinatorics 11(3), 293–303 (1995)

    Watanabe, M.: Some best possible bounds concerning the traces of finite sets II. Graphs and Combinatorics 11(3), 293–303 (1995)

    1995

  63. [71]

    Graphs and Combinatorics 10(2-4), 283–292 (1994)

    Watanabe, M., Frankl, P.: Some best possible bounds concerning the traces of finite sets. Graphs and Combinatorics 10(2-4), 283–292 (1994)

    1994

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.