Inclusion-exclusion by ordering-free cancellation (Q1633365): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of the inclusion-exclusion principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abstraction of Whitney's broken circuit theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique polynomials and independent set polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the subgraph component polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principle of inclusion-exclusion on semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the foundations of combinatorial theory I. Theory of M�bius Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a broken-cycle theorem for hypergraphs / rank
 
Normal rank

Latest revision as of 17:21, 17 July 2024

scientific article
Language Label Description Also known as
English
Inclusion-exclusion by ordering-free cancellation
scientific article

    Statements

    Inclusion-exclusion by ordering-free cancellation (English)
    0 references
    0 references
    19 December 2018
    0 references
    inclusion-exclusion principle
    0 references
    ordering-free cancellation
    0 references
    graph polynomial
    0 references
    broken set
    0 references

    Identifiers