On 3‐graphs with no four vertices spanning exactly two edges (Q6051388): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3200824446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing subgraphs in large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient testing of large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easily Testable Graph Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of the (Natural) Graph Properties Testable with One-Sided Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Erdős-Hajnal-type theorems in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Monotone 3‐Graph Property is Testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Erdős-Hajnal property for stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdös-Hajnal Conjecture-A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Hajnal-type theorems in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition relations for cardinal numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Theorems on Classifications of Subsets of a Given Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the graph removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient removal without efficient regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removal lemmas with polynomial bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph regularity and the multidimensional Szemerédi theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity lemmas for stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The counting lemma for regular <i>k</i>‐uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the removal lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Lemma for k-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4175585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200109 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:54, 2 August 2024

scientific article; zbMATH DE number 7740263
Language Label Description Also known as
English
On 3‐graphs with no four vertices spanning exactly two edges
scientific article; zbMATH DE number 7740263

    Statements

    On 3‐graphs with no four vertices spanning exactly two edges (English)
    0 references
    0 references
    0 references
    20 September 2023
    0 references
    property testing
    0 references
    hypergraphs
    0 references
    lower bounds
    0 references
    additive number theory
    0 references
    linear algebra
    0 references
    extremal problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references