---
res:
  bibo_abstract:
  - "The triangle removal states that if G contains  edge-disjoint triangles, then
    G contains  triangles. Unfortunately, there are no sensible bounds on the order
    of growth of , and at any rate, it is known that  is not polynomial in . Csaba
    recently obtained an asymmetric variant of the triangle removal, stating that
    if G contains  edge-disjoint triangles, then G contains  copies of . To this end,
    he devised a new variant of Szemerédi’s regularity lemma. We obtain the following
    results:\r\n\r\n• We first give a regularity-free proof of Csaba’s theorem, which
    improves the number of copies of  to the optimal number .\r\n\r\n• We say that
    H is -abundant if every graph containing  edge-disjoint triangles has  copies
    of H. It is easy to see that a -abundant graph must be triangle-free and tripartite.
    Given our first result, it is natural to ask if all triangle-free tripartite graphs
    are -abundant. Our second result is that assuming a well-known conjecture of Ruzsa
    in additive number theory, the answer to this question is negative.\r\n\r\nOur
    proofs use a mix of combinatorial, number-theoretic, probabilistic and Ramsey-type
    arguments.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Lior
      foaf_name: Gishboliner, Lior
      foaf_surname: Gishboliner
  - foaf_Person:
      foaf_givenName: Asaf
      foaf_name: Shapira, Asaf
      foaf_surname: Shapira
  - foaf_Person:
      foaf_givenName: Yuval
      foaf_name: Wigderson, Yuval
      foaf_surname: Wigderson
      foaf_workInfoHomepage: http://www.librecat.org/personId=2d0023a0-1567-11f0-833d-d5c1e476d4b5
  bibo_doi: 10.1017/fms.2024.68
  bibo_volume: 13
  dct_date: 2025^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/2050-5094
  dct_language: eng
  dct_publisher: Cambridge University Press@
  dct_title: An efficient asymmetric removal lemma and its limitations@
...