Pub Date : 2025-05-22DOI: 10.1007/s10474-025-01526-2
P. Frankl, J. Wang
A (k)-uniform family (mathcal{F}) is called intersecting if (Fcap F'neq emptyset) for all (F,F'in mathcal{F}). The shadow family (partial mathcal{F}) is the family of ((k-1))-element sets that are contained in some members of (mathcal{F}). The shadow degree (or minimum positive co-degree) of (mathcal{F}) is defined as the maximum integer (r) such that every (Ein partial mathcal{F}) is contained in at least (r) members of (mathcal{F}). Balogh, Lemons and Palmer [1] determined the maximum size of an intersecting (k)-uniform family with shadow degree at least (r) for (ngeq n_0(k,r)), where (n_0(k,r)) is doubly exponential in (k) for (4leq rleq k). In the present paper, we present a short proof of this result for (ngeq 2frac{(r+1)^r}{binom{2r-1}{r}}kbinom{2k}{k-1}) and (4leq rleq k).
{"title":"Intersecting families with large shadow degree","authors":"P. Frankl, J. Wang","doi":"10.1007/s10474-025-01526-2","DOIUrl":"10.1007/s10474-025-01526-2","url":null,"abstract":"<div><p>A <span>(k)</span>-uniform family <span>(mathcal{F})</span> is called intersecting if <span>(Fcap F'neq emptyset)</span> for all <span>(F,F'in mathcal{F})</span>. The shadow family <span>(partial mathcal{F})</span> is the family of <span>((k-1))</span>-element sets that are contained in some members of <span>(mathcal{F})</span>. The shadow degree (or minimum positive co-degree) of <span>(mathcal{F})</span> is defined as the maximum integer <span>(r)</span> such that every <span>(Ein partial mathcal{F})</span> is contained in at least <span>(r)</span> members of <span>(mathcal{F})</span>. Balogh, Lemons and Palmer [1] determined the maximum size of an intersecting <span>(k)</span>-uniform family with shadow degree at least <span>(r)</span> for <span>(ngeq n_0(k,r))</span>, where <span>(n_0(k,r))</span> is doubly exponential in <span>(k)</span> for <span>(4leq rleq k)</span>. In the present paper, we present a short proof of this result for <span>(ngeq 2frac{(r+1)^r}{binom{2r-1}{r}}kbinom{2k}{k-1})</span> and <span>(4leq rleq k)</span>.</p></div>","PeriodicalId":50894,"journal":{"name":"Acta Mathematica Hungarica","volume":"175 2","pages":"411 - 421"},"PeriodicalIF":0.6,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10474-025-01526-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145168557","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-05-21DOI: 10.1007/s10474-025-01523-5
R. Arul Ananthan, S. Balamurugan
A set (D) of vertices in a graph (G) is a dominating set, if each vertex of (G) that is not in (D) is adjacent to at least one vertex of (D). The minimum cardinality among all dominating sets in (G) is called the domination number of (G) and is denoted by (gamma(G)). A dominating set (S) such that the induced subgraph by (S) has at least one isolated vertex is called an isolate dominating set. An isolate dominating set of minimum cardinality is called the isolate domination number and is denoted by (gamma_0(G)). We define the isolate bondage number of a graph (G) to be the cardinality of a smallest set (E) of edges for which (gamma_0(G-E)>gamma_0(G)) and is denoted by (b_0(G)). In this paper, we initiate a study on the isolate bondage number.
{"title":"The isolate bondage number of a graph","authors":"R. Arul Ananthan, S. Balamurugan","doi":"10.1007/s10474-025-01523-5","DOIUrl":"10.1007/s10474-025-01523-5","url":null,"abstract":"<div><p>A set <span>(D)</span> of vertices in a graph <span>(G)</span> is a dominating set, if each vertex of <span>(G)</span> that is not in <span>(D)</span> is adjacent to at least one vertex of <span>(D)</span>. The minimum cardinality among all dominating sets in <span>(G)</span> is called the domination number of <span>(G)</span> and is denoted by <span>(gamma(G))</span>. A dominating set <span>(S)</span> such that the induced subgraph by <span>(S)</span> has at least one isolated vertex is called an <i>isolate dominating set</i>. An isolate dominating set of minimum cardinality is called the <i>isolate domination number</i> and is denoted by <span>(gamma_0(G))</span>. We define the <i>isolate bondage number</i> of a graph <span>(G)</span> to be the cardinality of a smallest set <span>(E)</span> of edges for which <span>(gamma_0(G-E)>gamma_0(G))</span> and is denoted by <span>(b_0(G))</span>. In this paper, we initiate a study on the <i>isolate bondage number</i>.</p></div>","PeriodicalId":50894,"journal":{"name":"Acta Mathematica Hungarica","volume":"175 2","pages":"395 - 410"},"PeriodicalIF":0.6,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145167918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-05-21DOI: 10.1007/s10474-024-01498-9
Z. Boros, R. Menzer
In this paper we consider a generalized polynomial ( f colon mathbb{R}^N to mathbb{R} ) that satisfies the additional equation ( f(x) f(y) = 0 ) for the pairs ( (x,y) in D ), where ( D subseteq mathbb{R}^{2N} ) has a positive Lebesgue measure or it is a second category Baire set. We prove that ( f(x) = 0 ) for all ( x in mathbb{R}^N ). In fact, the first statement is established in a considerably more general setting. Then we formulate statements concerning the signs of generalized monomials ( g colon mathbb{R} to mathbb{R} ) of even degree that satisfy the inequality ( g(x) g(y) geq 0 ) for the pairs ( (x,y) in E ), where ( E subseteq mathbb{R}^{2} ) has a positive planar Lebesgue measure or it is a second category Baire set.
本文考虑一个广义多项式 ( f colon mathbb{R}^N to mathbb{R} ) 它满足附加方程 ( f(x) f(y) = 0 ) 对于配对 ( (x,y) in D ),其中 ( D subseteq mathbb{R}^{2N} ) 有一个正的勒贝格测度或者它是第二类贝尔集。我们证明 ( f(x) = 0 ) 对所有人 ( x in mathbb{R}^N ). 事实上,第一种说法是在相当普遍的背景下建立起来的。然后,我们给出了关于广义单项式符号的表述 ( g colon mathbb{R} to mathbb{R} ) 满足不等式的偶数次 ( g(x) g(y) geq 0 ) 对于配对 ( (x,y) in E ),其中 ( E subseteq mathbb{R}^{2} ) 有一个正的平面勒贝格测度或者它是一个二类贝尔集。
{"title":"An alternative equation for generalized polynomials involving measure and category constraints","authors":"Z. Boros, R. Menzer","doi":"10.1007/s10474-024-01498-9","DOIUrl":"10.1007/s10474-024-01498-9","url":null,"abstract":"<div><p>In this paper we consider a generalized polynomial <span>( f colon mathbb{R}^N to mathbb{R} )</span> that satisfies the additional equation <span>( f(x) f(y) = 0 )</span> for the pairs <span>( (x,y) in D )</span>, where <span>( D subseteq mathbb{R}^{2N} )</span> has a positive Lebesgue measure or it is a second category Baire set. We prove that <span>( f(x) = 0 )</span> for all <span>( x in mathbb{R}^N )</span>. In fact, the first statement is established in a considerably more general setting. Then we formulate statements concerning the signs of generalized monomials <span>( g colon mathbb{R} to mathbb{R} )</span> of even degree that satisfy the inequality <span>( g(x) g(y) geq 0 )</span> for the pairs \u0000<span>( (x,y) in E )</span>, where \u0000<span>( E subseteq mathbb{R}^{2} )</span> has a positive planar Lebesgue measure or it is a second category Baire set.</p></div>","PeriodicalId":50894,"journal":{"name":"Acta Mathematica Hungarica","volume":"175 2","pages":"376 - 394"},"PeriodicalIF":0.6,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10474-024-01498-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145167917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}