Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

HOW MANY SUBSETS WHICH THEIR OPERATIONS WITH A FIXED SUBSET CONTAIN AT LEAST ONE ELEMENT OF A GIVEN COLLECTION?

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 4 (2024) · hlm. 2543–2554

DOI
10.30598/barekengvol18iss4pp2543-2554
ISSN
2615-3017, 1978-7227
Terbit
2024-10-11
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

We pose the following problem related to binary set operations on finite sets. Given a finite set. Let a binary set operation and be a non-empty collection of non-empty subsets of. For a fixed subset of, where, how many subsets of which their operation with contains at least one element of?. In this paper, we give the solution of this problem, especially for the subsets of size, using the inclusion-exclusion principle, Corrádi’s lemma, and Bonferroni’s inequality. In this context, the problem is related to determining the degree of nodes in certain graphs, such as graphs constructed with the adjacency rule depends on and the node set is a hypergraph.

Jaringan kolaborasi para penulis

3 penulis · 2 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universitas Gadjah Mada
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Yeni SusantiUniversitas Gadjah Mada1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">HOW MANY SUBSETS WHICH THEIR OPERATIONS WITH A FIXED SUBSET CONTAIN AT LEAST ONE ELEMENT OF A GIVEN COLLECTION?</dc:title>
	<dc:creator>Huda, Muhammad Nurul</dc:creator>
	<dc:creator>Lestari, Veni Rizki</dc:creator>
	<dc:description xml:lang="en-US">We pose the following problem related to binary set operations on finite sets. Given a finite set  . Let a binary set operation  &amp;nbsp;and  &amp;nbsp;be a non-empty collection of non-empty subsets of  . For a fixed subset  &amp;nbsp;of  , where  , how many subsets of  &amp;nbsp;which their operation  &amp;nbsp;with  &amp;nbsp;contains at least one element of  ?. In this paper, we give the solution of this problem, especially for the subsets of size  , using the&amp;nbsp;inclusion-exclusion principle, Corrádi’s lemma, and Bonferroni’s inequality. In this context, the problem is related to determining the degree of nodes in certain graphs, such as graphs constructed with the adjacency rule depends on  &amp;nbsp;and the node set is a hypergraph.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-10-11</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/13070</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss4pp2543-2554</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 4 (2024): BAREKENG: Journal of Mathematics and Its Application; 2543-2554</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss4year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/13070/8873</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Muhammad Nurul Huda, Veni Rizki Lestari</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>